assignment2.docx - a Problem 3-02(Algorithmic Consider the...

• 5
• 33% (3) 1 out of 3 people found this document helpful

This preview shows page 1 - 2 out of 5 pages.

Problem 3-02 (Algorithmic) Consider the following linear program: Max 3A + 2B s.t. 1A + 1B ≤ 8 3A + 1B ≤ 21 1A + 2B ≤ 16 A, B ≥ 0 The value of the optimal solution is 24. Suppose that the right-hand side of the constraint 1 is increased from 8 to 9. a. Use the graphical solution procedure to find the new optimal solution. b. Use the solution to part (a) to determine the dual value for constraint 1. If required, round your answer to 1 decimal place. Dual Value: fill in the blank 2 c. The computer solution for the linear program in Problem 1 provides the following right-hand- side range information: Constraint RHS Value Allowable Increase Allowable Decrease 1 8.00000 2.60000 1.00000 2 21.00000 3.00000 13.00000 3 16.00000 Infinite 6.50000 What does the right-hand-side range information for constraint 1 tell you about the dual value for constraint 1? If required, round your answers to five decimal places.
d. The dual value for constraint 2 is 0.5. Using this dual value and the right-hand-side range information in part (c), what conclusion can be drawn about the effect of changes to the right-hand side of constraint 2? If required, round your answers to 1 decimal place.
7 and fill in the blank 8