Example: quiz answers
Introduction to Semidefinite Programming

Introduction to Semidefinite Programming

Back to document page

We will write the standard linear programming dual problem as: m LD : maximize y ib i i=1 m s.t. y ia i + s = c i=1 n s ∈ℜ +. Given a feasible solution x of LP and a feasible solution (y,s) of LD, the duality gap is simply c x− P m i=1 y ib i = (c− P m · i=1 y ia i)·x = s·x ≥ 0, because x ≥ 0 and s ≥ 0.

  Programming

Download Introduction to Semidefinite Programming


Information

Domain:

Source:

Link to this page:

Please notify us if you found a problem with this document:

Other abuse

Advertisement

Related search queries