Asked by RENTO

Consider the linear programming problem:

Maximize P=60x+50y.

x+y≤80

5x+10y≤560

50x+20y≤1600

x≥0
y≥0

Use the simplex method to solve the problem. Use s, t, and u as your slack variables for the first, second, and third inequalities respectively. Use the final simplex tableau to identify the values below.

x =


y =

s =

t =

u =


P =

Answers

Answered by bobpursley
There is no way we can work this in ASCIii, so here is an example in detail:
http://math.uww.edu/~mcfarlat/s-prob.htm
Answered by tesfaye
z=6x+10y
2x+5y<=10
>=0,y>=0

Related Questions