Question: Consider the following problem. Maximize z = 3 x 1 + 2 x 2 subject to 2 x 1 + x 2 6 x 1
Consider the following problem.
Maximize z = 3x1 + 2x2
subject to 2x1 + x2 6
x1 + 2x2 6 and x1 0, x2 0
Without executing the simplex method, use its geometric interpretation (and the objective function) to identify the path (sequence of CPF solutions) it would follow to reach the optimal solution. For each of these CPF solutions in turn, identify the following decisions being made for the next iteration: (i) which defining equation is being deleted and which is being added; (ii) which indicating variable is being deleted (the entering basic variable) and which is being added (the leaving basic variable).
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
