Consider the system of linear inequalities: A x ⪯ b.The alternative system of inequalities is: λ ⪰ 0 , A T λ = 0 , b T λ ≤ 0These are strong alternatives since the optimum in the related system (A) below is achieved unless it is unbounded below.(A) minimize s, subject to: f i ( x ) − s ≤ 0 for i = 1 , … , m ; A x = b.

Question

Consider the system of linear inequalities:   A  x  ⪯  b.The alternative system of inequalities is:   λ  ⪰  0  ,      A    T    λ  =  0  ,      b    T    λ  ≤  0These are strong alternatives since the optimum in the related system (A) below is achieved unless it is unbounded below.(A) minimize s, subject to:       f    i    (  x  )  −  s  ≤  0 for   i  =  1  ,  …  ,  m  ;  A  x  =  b.

Dreforganzv · Accepted Answer

Consider the following two optimization problems:      min      λ    {      b    T    λ  :      A    T    λ  =  0  ,  λ  ≥  0  }  , and      max    x    {      0    T    x  :  A  x  ≤  b  }  .Note that the are duals, let&#039;s call the first one the primal problem and the second one the dual.If the primal is infeasible, the dual is infeasible or unbounded. If the primal is unbounded, the dual is infeasible. You can switch primal and dual in these statements. These statements follow from the weak duality theorem.The two lines of reasoning here are:1. If the dual is feasible, the dual has optimal value   0, and therefore the primal also has optimal value   0 (by strong duality), and therefore you cannot have   λ such that       b    T    λ  &amp;lt;  0,       A    T    λ  =  0.2. If there is a   λ  ≥  0 for which       b    T    λ  &amp;lt;  0 and       A    T    λ  =  0, then the primal problem is unbounded (fill in   t  λ and let   t  →  ∞), therefore the dual is infeasible.

Consider the system of linear inequalities: A x ⪯ b . The alternati

Answered question

Answer & Explanation

New Questions in Algebra I