Question

Use the method of this section to solve the linear programming problem. Minimize   C = −8x...

Use the method of this section to solve the linear programming problem.

Minimize  

C = −8x + 9y
subject to  
x + 3y ≤ 60
2x + y ≥ 45
x ≤ 40
x ≥ 0, y ≥ 0  

The minimum is C =

at (x, y) =

Math   Algebra   
0 0
Add a commentTranscribed image text
Next >

Homework Answers

Answer #1

The minimum is C = -320 at (x,y) =(40,0)

0 0
Know the answer?
Your Answer:

Post as a guest

Your Name:

What's your source?

Earn Coins

Coins can be redeemed for fabulous gifts.

Log In

Sign Up

Not the answer you're looking for?
Ask your own homework help question
Similar Questions
Use the method of this section to solve the linear programming problem. Minimize   C = x...
Use the method of this section to solve the linear programming problem. Minimize   C = x + 2y subject to   4x + 7y ≤ 60 2x + y = 28 x ≥ 0, y ≥ 0    The minimum is C =   at (x, y) =
Solve the linear programming problem by the method of corners. Minimize C = 8x + 3y...
Solve the linear programming problem by the method of corners. Minimize C = 8x + 3y subject to x + y ≤ 48 x + 3y ≥ 60 9x + 5y ≤ 320 x ≥ 10, y ≥ 0
Solve the linear programming problem by the method of corners. Minimize C = 4x + 6y...
Solve the linear programming problem by the method of corners. Minimize C = 4x + 6y subject to 4x + y ≥ 38 2x + y  ≥ 30 x + 3y  ≥ 30 x ≥ 0, y ≥ 0 The minimum is C = at (x, y) =
Use the method of this section to solve the linear programming problem. Maximize   P = 11x...
Use the method of this section to solve the linear programming problem. Maximize   P = 11x + y subject to   2x + y ≤ 20 −x + y ≥ 2 x ≥ 0, y ≥ 0   The maximum is P = at (x, y) =
Use the simplex method to solve the linear programming problem. Maximize P = 4x + 3y...
Use the simplex method to solve the linear programming problem. Maximize P = 4x + 3y subject to 3x + 4y ≤ 30 x + y ≤ 9 2x + y ≤ 17 x ≥ 0, y ≥ 0  
Solve the linear programming problem by the method of corners. Maximize P = 2x + 3y    ...
Solve the linear programming problem by the method of corners. Maximize P = 2x + 3y     subject to   x + y ≤ 10 3x + y ≥ 12 −2x + 3y ≥ 11 x ≥ 0, y ≥ 0
Solve the linear programming problem by the method of corners. Maximize P = 2x + 6y...
Solve the linear programming problem by the method of corners. Maximize P = 2x + 6y subject to 2x + y ≤ 16 2x + 3y ≤ 24 y ≤  6 x ≥ 0, y ≥ 0 The maximum is P = at (x, y) = .
Solve the linear programming problem by the method of corners. Maximize P = 5x + 7y...
Solve the linear programming problem by the method of corners. Maximize P = 5x + 7y subject to 2x + y ≤ 16 2x + 3y ≤ 24 y ≤  7 x ≥ 0, y ≥ 0 The maximum is P = at (x, y) = .
2. Solve the linear programming problem by the simplex method. Maximize 40x + 30y subject to...
2. Solve the linear programming problem by the simplex method. Maximize 40x + 30y subject to the constraints: x+y≤5 −2x + 3y ≥ 12 x ≥ 0, y ≥ 0
Use the technique developed in this section to solve the minimization problem. Minimize   C = x...
Use the technique developed in this section to solve the minimization problem. Minimize   C = x − 7y + z subject to   x − 2y + 3z ≤ 10 2x + y − 2z ≤ 15 2x + y + 3z ≤ 20 x ≥ 0, y ≥ 0, z ≥ 0   The minimum is C =   at (x, y, z) =
ADVERTISEMENT
Need Online Homework Help?

Get Answers For Free
Most questions answered within 1 hours.

Ask a Question
ADVERTISEMENT