Consider a linear programming problem with max objective subject to three (...

Transcribed Image Text:

Consider a linear programming problem with max objective subject to three (<) constraints. Suppose that the simplex method is used to solve the problem. Denote by x4, xs and xs the slack variables corresponding to the three constraints, respectively. The optimal tableau for the problem is given as follows: X2 X3 RHS В.V. X4 X6 1 1 64 1.6 1.2 -0.2 -2 -0.5 9. X2 -6 0.5 3 X5 6. 1 0.5 6. X3 (a) Is this optimal solution unique? Why? (2 marks) (b) Identify the set of solutions to the above problem. (4 marks) (c) If the right hand side of the constraints should increase, which constraint is preferred? Why? (3 marks) Consider a linear programming problem with max objective subject to three (<) constraints. Suppose that the simplex method is used to solve the problem. Denote by x4, xs and xs the slack variables corresponding to the three constraints, respectively. The optimal tableau for the problem is given as follows: X2 X3 RHS В.V. X4 X6 1 1 64 1.6 1.2 -0.2 -2 -0.5 9. X2 -6 0.5 3 X5 6. 1 0.5 6. X3 (a) Is this optimal solution unique? Why? (2 marks) (b) Identify the set of solutions to the above problem. (4 marks) (c) If the right hand side of the constraints should increase, which constraint is preferred? Why? (3 marks)

Answer rating: 100% (QA)

Let first comlt thie table Us Say to Ahi ngs canily see the B V B ... View the full answer