Posted by **anonymous** on Monday, July 18, 2011 at 4:10am.

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.

- math -
**Damon**, Monday, July 18, 2011 at 7:25am
I assume those ? marks are < and > marks

corners

(0,0)

4x+y = 20

if x = 0, y = 20

if y = 0, x = 5

x+y = 20

if x = 0 , y = 20

if y = 0 , x = 20

this one is above and beyond the others when you graph it

x+y = 10

if x = 0 , y = 10

if y = 0, x = 10

intersection of

x+y = 10

4x+y = 20

---------

-3 x = -10

x = 10/3

y = 7/3

graph those and you will see that (0,0) is the minimum of 3x+6y

## Answer this Question

## Related Questions

- linear programming - Minimize z = 3x + 6y subject to: 4x + y ≥ 20 x + y...
- 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 - Maximize z = 16x + 8y subject to: 2x + y ≤ 30 x + 2y...
- linear programming - A feed company is developing a feed supplement from two ...
- Math - Given the following LP model (represented abstractly with decision ...
- algebra - what is the minimum value for z=3x-1/2y over the feasibility region ...
- math - A manufacturer has a maximum of 240, 360, and 180 kilograms of wood, ...
- math - A manufacturer has a maximum of 240, 360, and 180 kilograms of wood, ...
- Old -Linear programming - up where it may be found - Posted by Anonymous on ...