Question: Consider the following Linear Program: Minimize Z = 2x1 + 5x2 + 3x3 subject to - x1 + 3x2 + 5x3 30 (Constraint-A) 5x1 +
Consider the following Linear Program:
Minimize Z = 2x1 + 5x2 + 3x3
subject to - x1 + 3x2 + 5x3 30 (Constraint-A)
5x1 + 6x2 + 5x3 20 (Constraint-B)
x1 + x2 + 2x3 10 (Constraint-C)
x1 0, x2 0, x3 0
a) Work through Simplex, using the Big M method, to determine the Optimal solution. (20 marks)
b) Apply Simplex, using the Two-Phase method, to determine the Optimal solution. (20 marks)
c) Assess whether the obtained Optimal Solution is Degenerate or not, and Multiple Optimal or not. Give reasons for your assessment. (5 marks)
d) Which of the above two methods (in parts a and b) do you prefer for solving an LP, and why? (5 marks)
Optimization methods
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
