This was posted a year ago, but no answer was posted. Here's my crack at it and hopefully I can get some critique because I want to get better at this.

Maximize $z=-3x_1-x_2-x_3$

The dual problem is:

So obviously the primal problem is already at it's optimal dictionary with an optimal solution of (0,0,0,5,0,20). Then by complementary slackness theorem we know that because $x_4$ and $x_6$ are greater than 0 then $y_1$ and $y_3$ are 0 in the optimal solution for the dual. Then we can see in the dual problem that the optimal value is 0, but we can see this will be satisfied for any y, because our constraints in the dual are all negative so the solution to the dual is (0,$y_2\ge0$,0)


Your Answer

By clicking “Post Your Answer”, you agree to our terms of service, privacy policy and cookie policy

Browse other questions tagged or ask your own question.