HW9 - 9th Homework for IEOR162 Linear Programming Semester:...

Info iconThis preview shows pages 1–2. Sign up to view the full content.

View Full Document Right Arrow Icon
9th Homework for IEOR162 Linear Programming Semester: Fall 2010 Instructor: Dr. Sarah Drewes Due to: Thursday, December 2, 2010, (at the beginning of class) P1 For the following LP, max z = - x 1 + 5 x 2 s.t. x 1 + 2 x 2 0 . 5 - x 1 + 3 x 2 0 . 5 x 1 ,x 2 0 , row 0 of the optimal simplex tableau is z + 0 . 4 s 1 + 1 . 4 s 2 =? Determine the optimal z -value for the given LP. P2 Consider max z = 4 x 1 + x 2 s.t. 3 x 1 + 2 x 2 6 6 x 1 + 3 x 2 10 x 1 ,x 2 0 . Suppose that row 0 of the optimal simplex tableau is found to be z + 2 x 2 + s 2 = 20 3 . Use the Dual Theorem to prove that the computations must be incorrect. P3 Given the primal LP: min x 1 - x 3 s.t. x 1 + 2 x 2 5 x 2 + 2 x 3 = 6 x 1 ,x 2 ,x 3 0 . Determine the dual of this problem and formulate the complementary slackness conditions for this program. Use them to solve the primal and dual problem. 1
Background image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
P4 Submit your handwritten answers, AMPL code, commands and output for this problem Recall the Dorian Auto problem in Chapter 3.2 of the textbook:
Background image of page 2
This is the end of the preview. Sign up to access the rest of the document.

This note was uploaded on 01/21/2011 for the course IEOR 162 taught by Professor Zhang during the Fall '07 term at Berkeley.

Page1 / 2

HW9 - 9th Homework for IEOR162 Linear Programming Semester:...

This preview shows document pages 1 - 2. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online