The optimal solution of this linear programming problem is at the intersection of constraints 1 and 2. Max 3x₁ + x₂ s.t. 4x₁ + x₂ ≤ 400 4x + 3x₂ ≤ 600 X₁ + 2x₂ ≤ 300 X1, X₂20 (a) Over what range can the coefficient of x₁ vary before the current solution is no longer optimal? (Round your answers to two decimal places.) to (b) Over what range can the coefficient of x₂ vary before the current solution is no longer optimal? (Round your answers to two decimal places.) to (c) Compute the dual value for the first constraint. Compute the dual value for the second constraint. Compute the dual value for the third constraint.

The optimal solution of this linear programming problem is at the intersection of constraints 1 and 2. Max 3x₁ + x₂ s.t. 4x₁ + x₂ ≤ 400 4x + 3x₂ ≤ 600 X₁ + 2x₂ ≤ 300 X1, X₂20 (a) Over what range can the coefficient of x₁ vary before the current solution is no longer optimal? (Round your answers to two decimal places.) to (b) Over what range can the coefficient of x₂ vary before the current solution is no longer optimal? (Round your answers to two decimal places.) to (c) Compute the dual value for the first constraint. Compute the dual value for the second constraint. Compute the dual value for the third constraint.

Practical Management Science

6th Edition

ISBN:9781337406659

Author:WINSTON, Wayne L.

Publisher:WINSTON, Wayne L.

Chapter3: Introduction To Optimization Modeling

Section: Chapter Questions

Problem 52P

See similar textbooks