[6.52] Consider the following optimal tableau of a maximization problem where the constraints are of the...

Transcribed Image Text:

[6.52] Consider the following optimal tableau of a maximization problem where the constraints are of the <type: 0 c. Z 1 a. 0 0 x3 0 x1 x2 0 0 0 0 1 0 0 1 X3 X4 0 2 1 0 0 XS x6 0 2 0 1 0 1/2 -1 -2 5 -3/10 2 -1 2 SLACKS 1/2 -1 17 1/10 1/5 Xg 2 -1 RHS 8 Find the optimal objective value 8. b. Would the solution be altered if a new activity x9 with coefficients (6,0,-3) in the constraints, and price of 7, were added to the problem? 3 1 How large can b (the first constraint resource) be made without violating feasibility? [6.52] Consider the following optimal tableau of a maximization problem where the constraints are of the <type: 0 c. Z 1 a. 0 0 x3 0 x1 x2 0 0 0 0 1 0 0 1 X3 X4 0 2 1 0 0 XS x6 0 2 0 1 0 1/2 -1 -2 5 -3/10 2 -1 2 SLACKS 1/2 -1 17 1/10 1/5 Xg 2 -1 RHS 8 Find the optimal objective value 8. b. Would the solution be altered if a new activity x9 with coefficients (6,0,-3) in the constraints, and price of 7, were added to the problem? 3 1 How large can b (the first constraint resource) be made without violating feasibility?

Answer rating: 100% (QA)

Answer c b The Coefficients of feasible sol... View the full answer