Posted by **John** on Monday, September 20, 2010 at 9:27pm.

Solve this linear programming problem using the simplex method:

Maximize P = 21x + 12y + 24z subject to these constraints:

3x + 2y + 3z ≤ 864

15x + 6z ≤ 1296

9x + 8y + 18z ≤ 4608

x ≥ 0, y ≥ 0, z ≥ 0

Maximum value for P = ?.

This value of P occurs when:

x = ?

y = ?

z = ?

## Answer This Question

## Related Questions

- 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. ...
- Math - Use the simplex method to find the maximum value of P = 3x + 3y subject ...
- Linear Programming - Maximize P = 16x + 80y subject to these constraints: 2x + ...
- Business Math - Using the simplex method, solve the following linear programming...
- Algebra - Maximize the following objective function using simplex method: Z=10 ...
- math,help - this is from another section one of the problems can someone help me...
- algebra 1 help please - 4) a student score is 83 and 91 on her first two quizzes...
- Math - Use the simplex meth to solve the linear programming problem Maximize z...

More Related Questions