EN.625.415 Final: Final Solutions Fall 2012

26 views7 pages
14 Mar 2019
School
Department
Professor

Document Summary

4: (10 points) write down a feasible point that is not a basic feasible solution. 2 : (10 points) another simplex tableau associated with the same problem is: Fill in the two missing entries * . (you may not pivot from tableau to tableau; you must answer (directly) just with the tableaus here, and you must explain how you got your answer. ) Solution: the upper right hand corner is 5, and the other missing entry is 2. This is because from the top row of the rst tableau z = 13 3x5 2x6 4x7, and from the middle row of the rst tableau x2 = 3 + x5 + 0x6 x7. Problem 2: (10 points) prove strong duality for linear programming. Write the optimal objective function of lp, and the terminating condition of simplex algorithm. Then write a particular vector and consider it for dp)

Get access

Grade+20% off
$8 USD/m$10 USD/m
Billed $96 USD annually
Grade+
Homework Help
Study Guides
Textbook Solutions
Class Notes
Textbook Notes
Booster Class
40 Verified Answers

Related Documents

Related Questions