This preview shows page 1. Sign up to view the full content.
Unformatted text preview: nvector x or which Ax 0 and cx > 0 . (b) Suppose the linear system is ineasible , i.e., there is no mvector y so that yA = c, y 0 . Show that in this case there is an nvector x so that Ax 0 and cx > 0 . (HINT: Consider the LP { min y s.t. yA = c, y } 6. BHM IV/15. Hand in all parts except d. 7. BHM IV/17. 8. Solve the linear program min 2 x 1 + 3 x 2 + 4 x 3 x 1 + 2 x 2 + x 3 3 + 2 2 x 1x 2 + 3 x 3 4 x 1 , x 2 , x 3 or all values o ! Plot the objective unction in terms o . 9. BHM VIII/2, VIII/8, VIII/16. 10. BHM VIII/10. Solve via either algorithm we studied or the transportation model; use the minimum (maximum) matrix rule to Fnd an initial easible assignment. 11. BHM VIII/15, notice typo: The corresponding unit costs rom . .. ....
View
Full
Document
 Spring '08
 TODD

Click to edit the document details