The optimal solution of this linear programming problem is at the intersection of constraints 1 (c) and 2 (c2). Max 2x1 + 2 s.t. 41 + l22 < 400 41 + 3r2 < 600 le1 + 2x2 < 300 T1, T2 2 0 Over what range can the coefficient of r vary before the current solution is no longer optimal? O 1.45 < C S 4.58 O 1.33 < Ci < 4 O 3 < a < 5 O 0.5 < ci < 1.5

Practical Management Science
6th Edition
ISBN:9781337406659
Author:WINSTON, Wayne L.
Publisher:WINSTON, Wayne L.
Chapter5: Network Models
Section5.5: Shortest Path Models
Problem 30P
icon
Related questions
Question
The optimal solution of this linear programming problem is at the intersection of constraints 1 (c) and 2 (c2).
Mar 201 + 2
s.t. 41 + lx2 < 400
41 + 32 < 600
l01 + 202 < 300
T1, 2 0
Over what range can the coefficient of vary before the current solution is no longer optimal?
O 1.45 < a < 4.58
O 1.33 < 1 < 4
O 3 < a < 5
O 0.5 < C < 1.5
Transcribed Image Text:The optimal solution of this linear programming problem is at the intersection of constraints 1 (c) and 2 (c2). Mar 201 + 2 s.t. 41 + lx2 < 400 41 + 32 < 600 l01 + 202 < 300 T1, 2 0 Over what range can the coefficient of vary before the current solution is no longer optimal? O 1.45 < a < 4.58 O 1.33 < 1 < 4 O 3 < a < 5 O 0.5 < C < 1.5
Expert Solution
steps

Step by step

Solved in 2 steps with 5 images

Blurred answer
Similar questions
  • SEE MORE QUESTIONS
Recommended textbooks for you
Practical Management Science
Practical Management Science
Operations Management
ISBN:
9781337406659
Author:
WINSTON, Wayne L.
Publisher:
Cengage,