Linear Programming - canonical form and simplex methods
Consider the following linear programming model:
Minimize Z= -3x1+5x2-6x3+10
a). Express model in canonical form and show that the all slack point is feasible
b). Perform by hand one iteration of the simplex method for this model, starting from the all slack point. state the new basis list and the new feasible point.
c). Perform by hand the next iteration of the simplex method to find the next feasible point and show that this is indeed the optimum,