Problems:
1. Consider the following linear program.
Minimize z = -7x1 + 3x2
subject to 2x1 + 4x2 = 15 (C1)
- 2x1 + x2 ≥ 4 (C2)
Solve the problem using the two-phase Simplex algorithm as follows.
1) Write the problem in the equality form
2) Introduce artificial variables, write the objective of Phase I
3) Set up the Simplex tableau and solve the Phase I problem using steepest ascent rule.
4) Setup the Simplex tableau in Phase II (10). Notice that you do not have to solve it