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

Minimize z = 3x + 6y subject to:

4x + y ≥ 20

x + y ≤ 20

x + y ≥ 10

x ≥ 0

y ≥ 0

Graph the feasibility region.

Identify all applicable corner points of the feasibility region.

Find the point(s) (x,y) that minimizes the objective function z = 3x + 6y.

## Answer This Question

## Related Questions

- linear programming - Maximize z = 16x + 8y subject to: 2x + y ≤ 30 x + 2y...
- 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 ...
- Algebra 2 - Jack is selling wristbands and headbands to earn money for camp. He ...
- Math - Solve the linear programming problem by the method of corners. Minimize C...
- HELPPP - Solve the linear programming problem by the method of corners. Minimize...
- Algebra 2 - Can someone explain this inequality equation to me please? I'm so ...
- 7th grade math help Ms. Sue - 3. Which of the following equations has an ...
- Math - 1. 5h – 9 = –16 + 6h A) 4 B) –7 C) 7 <------------------------- D) 10 ...
- Math - 1. 5h – 9 = –16 + 6h A) 4 B) –7 <------------------------- C) 7 D) 10 ...

More Related Questions