# math

posted by .

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 -

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

## Similar Questions

minimize z= 5x + 9y subject to 6x + y >= 18 2x + 3y >= 30 x<= 12 x,y>= 0 find the corner points, ans subject the objective function to the corner points, finding the minimum value of z giving the constraints. i know the …
2. ### linear programming

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 …
3. ### linear programming

A manufacturer produces two items, bookcases and library tables. Each item requires processing in each of two departments. Department I has 40 hours available and department II has 36 hours available each week for production. To manufacture …
4. ### linear programming

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 …
5. ### linear programming

A feed company is developing a feed supplement from two grains A and B. Each kilogram of A contains 0.3 grams of protein and 0.2 grams of carbohydrates; each kilogram of B contains 0.9 grams of protein and 0.1 grams of carbohydrates. …
6. ### MATH

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 …
7. ### math

A company is planning to purchase and store two items, gadgets and widgets. Each gadget costs \$2.00 and occupies 2 square meters of floor space; each widget costs \$3.00 and occupies 1 square meter of floor space. \$1,200 is available …
8. ### math

A manufacturer has a maximum of 240, 360, and 180 kilograms of wood, plastic and steel available. The company produces two products, A and B. Each unit of A requires 1, 3 and 2 kilograms of wood, plastic and steel respectively; each …
9. ### math

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 …
10. ### math

A manufacturer has a maximum of 240, 360, and 180 kilograms of wood, plastic and steel available. The company produces two products, A and B. Each unit of A requires 1, 3 and 2 kilograms of wood, plastic and steel respectively; each …

More Similar Questions