Posted by ANONIMOUS on Tuesday, July 12, 2011 at 12:01am.
1. 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.

MATH  MathMate, Wednesday, July 13, 2011 at 6:35pm
The corner points are, by inspection:
(0,30),(0,12), (15,0), (24,0),
and (12, 6)[inters. of the two lines].
The points in italics do not satisfy at least one constraint.
Now evaluate the objective function at each of the feasible corner points and select the one that maximizes the objective function.
If there are two points that give the same maximum value of the objective function, then any point that lie on the line joining the two points and is located between the two points maximizes the objective function.
Answer This Question
Related Questions
 math  Maximize z = 16x + 8y subject to: 2x + y ≤ 30 x + 2y ≤ 24 x...
 linear programming  Maximize z = 16x + 8y subject to: 2x + y ≤ 30 x + 2y...
 linear programming  Minimize z = 3x + 6y subject to: 4x + y ≥ 20 x + y...
 math  Minimize z = 3x + 6y subject to: 4x + y ? 20 x + y ? 20 x + y ? 10 x ? 0 ...
 Algebra 2  Can someone explain this inequality equation to me please? I'm so ...
 Algebra 2  Jack is selling wristbands and headbands to earn money for camp. He ...
 Math  Solve this linear programming problem using the simplex method: Maximize ...
 Math  Maximize P = 16x + 80y subject to these constraints: 2x + 20y ≤ 430...
 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 + ...
More Related Questions