SOLUTION: linear programing minimize subject to C=2x+5y 4x+y≧40 2x+y≧30 x+3y≧30 x≧0 y≧0

SOLUTION: linear programing minimize subject to C=2x+5y 4x+y≧40 2x+y≧30 x+3y≧30 x≧0 y≧0

Algebra.Com

Question 979056: linear programing
minimize subject to
C=2x+5y
4x+y≧40
2x+y≧30
x+3y≧30
x≧0 y≧0

Answer by Fombitz(32388) (Show Source): You can put this solution on YOUR website!
Your feasible region is unbounded.
.
.
.
Please correct and repost.
.
.
.

.
RELATED QUESTIONS
How do you graph y ≧ x + 5... (answered by Edwin McCravy)

find the solution to the inequality : x� ≧ 25 (answered by Edwin McCravy)

|x-1| + |x-2| + |x-4| ≧ 6 how to solve by graphical... (answered by josgarithmetic)

Which number would not be a possible solution to -10m - 8 ≧ 12m -... (answered by Edwin McCravy)

Minimize c=2x+3y+4z subject to minimize the problem: 4x+2y+z=10 x+y-z=5... (answered by Edwin McCravy)

Minimize c=2x+3y+4z subject to minimize the problem: 4x+2y+z≥10 x+y-z≥5... (answered by ikleyn)

Minimize C=2x+3y+4z subject to minimize the problem: 4x+2y+z=10 x+y-z=5... (answered by ikleyn)

Minimize C=2x+3y +4z subject to minimize the problem: 4x+2y+z=10 x+y-z=5... (answered by ikleyn)

Use the graphic method to solve this problem Minimize the objective function: 3x+2y (answered by ikleyn,greenestamps)