Posted by **nmh** on Friday, July 8, 2011 at 2:52pm.

Maximize z = 16x + 8y subject to:

2x + y ≤ 30

x + 2y ≤ 24

x ≥ 0

y ≥ 0

Graph the feasibility region.

Identify all applicable corner points of the feasibility region.

Find the point(s) (x,y) that maximizes the objective function z = 16x + 8y.

## Answer this Question

## Related Questions

- math - Maximize z = 16x + 8y subject to: 2x + y ≤ 30 x + 2y ≤ 24 x...
- MATH - 1. Maximize z = 16x + 8y subject to: 2x + y ≤ 30 x + 2y ≤ 24 ...
- linear programming - Minimize z = 3x + 6y subject to: 4x + y ≥ 20 x + y...
- Math - Solve this linear programming problem using the simplex method: Maximize ...
- Linear Programming - Maximize P = 16x + 80y subject to these constraints: 2x + ...
- Math - Maximize P = 16x + 80y subject to these constraints: 2x + 20y ≤ 430...
- math - Minimize z = 3x + 6y subject to: 4x + y ? 20 x + y ? 20 x + y ? 10 x ? 0 ...
- 7th grade math help Ms. Sue - 3. Which of the following equations has an ...
- Math - Use the simplex method to find the maximum value of P = 3x + 3y subject ...
- Msth - olve each inequality. 1. m – 7 < 6 (1 point) m < –1 m > 1 m <...