Posted by **jas** on Wednesday, June 13, 2007 at 12:17pm.

this is from another section one of the problems can someone help me.

dierections: use the simplex method to solve each linear programming problem.

maximize z = 12x1 +15x2 +5x3

subject to: 2x1+2x2+x3 <= 8

x1+4x2+3x3<=12

with x>=0,x2>=0,x3>0

## Answer This Question

## Related Questions

- Math - Use the simplex meth to solve the linear programming problem Maximize z...
- Simplex Method - Solve the linear programming problem by the simplex method. ...
- Simplex Method - Solve the linear programming problem by the simplex method. ...
- simplex Method - Solve the linear programming problem by the simplex method. ...
- linear programming problem - Consider the linear programming problem: Maximize ...
- Business Math - Using the simplex method, solve the following linear programming...
- Math - Maximize P= 8x1+12x2 Subject to 2x1+4x2<=24 3x1+3x2<=21 4x1+2x2<...
- simplex method - Maximize P=60x+50y. ? ?x+y?80 ? ?5x+10y?560 ? ?50x+20y?1600...
- Math - Solve this linear programming problem using the simplex method: Maximize ...
- Linear Programming - calculate the lower bound from min z= 4x1 + 2x2 2x1 - 3x2...

More Related Questions