SOLUTION: In solving a linear programming problem, you are given the following initial tableau. 7 3 2 1 0 0 5 4 1 1 0 1 0 20 -5 -10 -1 0 0 1 0 What is the problem being solved?

 7     3    2    1     0     0      5
 4     1    1    0     1     0     20
-5   -10   -1    0     0     1      0

Put in ordinary variables x, y, z, P, 
slack variables s1, s2, and + signs between 
terms where necessary to show addition:  

 7x +  3y + 2z + 1s1 + 0s2 + 0P =  5
 4x +  1y + 1z + 0s1 + 1s2 + 0P = 20
-5x - 10y - 1z + 0s1 + 0s2 + 1P =  0

Erase the terms with 0 coefficients,
and the 1 coefficients:



Erase the slack variables in the first two equations
and change the  signs to 's. Also, solve
the bottom equation for P

 

The problem is:

Maximize 

subject to the constraints:



Edwin