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?
Asked
Active
Viewed 198 times
2
-
1Look up complementary slackness. – Yuval Filmus Feb 02 '20 at 06:16