2
$\begingroup$

Say I have a primal program P with n variables and c constraints. Let's say that I have an optimal solution for the dual program D, in which the y1, the variable related to the first constraint in P, is zero. Does that imply that I could run Simplex on P without the first constraint and get the same optimal solution as if ran Simplex with the first constraint?

$\endgroup$
  • 1
    $\begingroup$ Look up complementary slackness. $\endgroup$ – Yuval Filmus Feb 2 at 6:16

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.