Unformatted text preview: Let (P) be a linear program and let (D) be its dual. Let x * be a feasible solution for (P) and let y * be a feasible solution for (D). Show that if all variables of (P) and (D) are free (unrestricted) then x * is an optimal solution to (P) and y * is an optimal solution to (D). Exercise 3: Prove Theorem 4.9 for the case where (P) is in standard inequality form. Important: your proof should be self contained. In particular you should NOT convert (P) to a problem in standard equality form and apply Theorem 4.7. 1...
View
Full Document
 Fall '97
 Wolkowicz
 Operations Research, Optimization, Yi, optimal solution, linear program, following linear program

Click to edit the document details