In Problem, first solve the linear programming problem by the simplex method, keeping track of the basic feasible solutions at each step. Then graph the feasible region and illustrate the path to the optimal solution determined by the simplex method.
Maximize subject to
P = 5x1 + 3x2
5x1 + 4x2 =s 100
2x1 + x2< 28
4x1 + x2<42
x1 < 10
x1, x2>0