Homework Help: linear programming

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.

No one has answered this question yet.

Answer this Question

Related Questions

math - Maximize z = 16x + 8y subject to: 2x + y ≤ 30 x + 2y &#...
MATH - 1. Maximize z = 16x + 8y subject to: 2x + y ≤ 30 x + 2y &#...
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 = 2x − 3y subject to x + 2y ≤ 14 6x + y &...
college - Maximize z=16x + 8y subject to: 2x + y<30 x +2y<24 x&...
college math - Maximize z=16x + 8y subject to: 2x + y<30 x +2y<24 ...
Math - Maximize P = 16x + 80y subject to these constraints: 2x + 20y &#8804...
Math - Solve the inequality. Then graph the solution on a number line. -16 is ...
Math - Minimize C=7x+3y+4z 0≤x 0≤y 0≤z 100&#...

For Further Reading

First Name:
School Subject:
Answer: