Describe S = { ( u , t ) ∈ R n × R : u ′ x ≤ t for all x ∈ R n with A x ≤ b , u ′ x ≥ t for all x ∈ R n with C x ≤ d }using finitely many linear inequalities and equations.It's easy to show S is convex. We can describe S as S = { ( u , t ) ∈ R n × R : sup x ∈ R n , A x ≤ b u ′ x ≤ t ≤ inf x ∈ R n , C x ≤ d u ′ x } .Taking the supremum and infimum over infinitely many expressions is not allowed in the finitely many linear inequalities and equations. The LHS and RHS are solutions to linear programming problems and the hint is to use strong duality, but I couldn't find a way to make the number of conditions finite.

Question

Describe  S  =  {  (  u  ,  t  )  ∈            R        n    ×      R    :      u    ′    x  ≤  t   for all   x  ∈            R        n     with   A  x  ≤  b  ,      u    ′    x  ≥  t   for all   x  ∈            R        n     with   C  x  ≤  d  }using finitely many linear inequalities and equations.It&#039;s easy to show S is convex. We can describe S as  S  =      {    (    u    ,    t    )    ∈                  R            n        ×          R        :          sup              x        ∈                              R                    n                ,        A        x        ≤        b                    u      ′        x    ≤    t    ≤          inf              x        ∈                              R                    n                ,        C        x        ≤        d                    u      ′        x    }    .Taking the supremum and infimum over infinitely many expressions is not allowed in the finitely many linear inequalities and equations. The LHS and RHS are solutions to linear programming problems and the hint is to use strong duality, but I couldn&#039;t find a way to make the number of conditions finite.

plodno8n · Accepted Answer

Step 1This is done with duality. Let me show one inequality:      max    x    {      u    T    x  :  A  x  ≤  b  }  ≤  t      min    y    {      b    T    y  :      A    T    y  =  u  ,  y  ≥  0  }  ≤  t  ∃  y  ≥  0  :      b    T    y  ≤  t  ,      A    T    y  =  u

Describe S = <mo fence="false" stretchy="false">{ ( u , t ) ∈<!-

Answered question

Answer & Explanation

New Questions in Pre-Algebra