SOLUTION: Solve the linear programming problem by the method of corners. Minimize C = 5x + y subject to x + 2y ≥ 36 x + y ≥ 30 x ≥ 0, y ≥ 0 The min

Algebra.Com
Question 726555: Solve the linear programming problem by the method of corners.
Minimize C = 5x + y
subject to x + 2y ≥ 36
x + y ≥ 30
x ≥ 0, y ≥ 0
The minimum is C = at
(x, y) =

.
Answer by lynnlo(4176)   (Show Source): You can put this solution on YOUR website!

RELATED QUESTIONS

Solve the linear programming problem by the method of corners. Minimize C = 4x + 3y (answered by Theo,ValerieDavis,ikleyn)
Solve the linear programming problem. Minimize z = 11x + 6y + 7 subject to: x ≥ 0,... (answered by ikleyn)
Solve the linear programming problem by the method of corners. Maximize P = 2x + 5y (answered by lynnlo)
Use the graphical method to solve the following linear programming problem. Restrict x... (answered by Edwin McCravy)
Maximize P = 3x + 2y
subject to
  2x + y ≤ 18
2x + 3y  ≤ 42
 3x + y   (answered by Edwin McCravy)

I have no idea how to calculate this. Appreciate the help. Thanks.
Solve the following... (answered by stanbon,ikleyn)

Solve the linear programming problem by the method of corners.
Maximize	P = x + 6y... (answered by ikleyn)

Solve the linear programming problem by the method of corners.
Maximize	P = x + 6y... (answered by ikleyn)

2.4 Determine the dual problem of the linear programming problem below:

Minimize C= 4x  (answered by ikleyn)