In Problems 29 and 30, 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.

Transcribed Image Text:

Maximize subject to 5x₁ + 4x₂ P = 5x₁ + 3x₂ 100 28 2x₁ + x₂ = 4x₁ + x₂ = 42 VI VI VI AI X₁10 X1, X2 = 0