Friday

April 18, 2014

April 18, 2014

Posted by **ANONIMOUS** on Tuesday, July 12, 2011 at 12:01am.

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:35pmThe 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.

**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...

Math - Solve this linear programming problem using the simplex method: Maximize ...

math - Maximize P = 2x − 3y subject to x + 2y ≤ 14 6x + y ≤ ...

linear programming - Minimize z = 3x + 6y subject to: 4x + y ≥ 20 x + y...

math - Maximize and minimize p = x + 2y subject to x + y ≥ 8 x + y ≤...

algebra 1 - (2x-1)/3 +3≤-4 or (8x-2)/2 -1≥6 a. x≤-10 or x&#...

math (double checking) - I've posted this question before but I forgot to say ...

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 ...