Given the following linear programming problem
Max
10x1 + 12x2
s.t.
1x1 + 2x2 ≥ 40
5x1 + 8x2 ≤ 160
1x1 + 1x2 ≤ 40
x1, x2 ≥ 0
the final tableau is
a.
Find the range of optimality for c1 and c2.
b.
Find the range of feasibility for b1, b2, and b3.
c.
Find the dual prices.
Correct Answer:
Verified
a.7.5 ≤ c1 < ∞
−∞ <...
View Answer
Unlock this answer now
Get Access to more Verified Answers free of charge
Q10: The ranges for which the right-hand-side values
Q20: The entries in the associated slack column
Q21: Given the following linear programming problem
Max Z
0.5x1
Q22: Explain the simplex tableau location of the
Q23: When sensitivity calculations yield several potential upper
Q25: Explain why the zj value for a
Q26: Write the dual to the following problem.
Min
12x1
Q27: The linear programming problem:
Max
6x1 + 2x2 +
Q28: For this optimal simplex tableau the original
Q29: Explain how to put an equality constraint
Unlock this Answer For Free Now!
View this answer and more for free by performing one of the following actions
Scan the QR code to install the App and get 2 free unlocks
Unlock quizzes for free by uploading documents