Question

Solve the linear programming problem by the simplex method. Maximize   P = 5x + 4y subject...

Solve the linear programming problem by the simplex method.

Maximize  

P = 5x + 4y
subject to  
3x + 5y ≤ 214
4x + y ≤ 172
x ≥ 0, y ≥ 0   

The maximum is P =

at (x, y) = .

Math   Algebra   
0 0
Add a commentTranscribed image text
Next >

Homework Answers

Answer #1

​​​​​​.

.

So the maximum is P = 270​​​​​​

at (x, y) = (38, 20)

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 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  
Use the simplex method to solve the linear programming problem. Maximize   P = 6x + 5y...
Use the simplex method to solve the linear programming problem. Maximize   P = 6x + 5y subject to   3x + 6y ≤ 42 x + y ≤ 8 2x + y ≤ 12 x ≥ 0, y ≥ 0   The maximum is P = at (x, y) =
Use the simplex method to solve the linear programming problem. Maximize P = x + 2y...
Use the simplex method to solve the linear programming problem. Maximize P = x + 2y + 3z subject to 2x + y + z ≤ 14 3x + 2y + 4z ≤ 24 2x + 5y − 2z ≤ 10 x ≥ 0, y ≥ 0, z ≥ 0   The maximum is P =   at (x, y, z) = ( ) .
Solve the linear programming problem by the method of corners. Find the minimum and maximum of...
Solve the linear programming problem by the method of corners. Find the minimum and maximum of P = 5x + 4y subject to 3x + 5y ≥ 32 3x + y ≤ 16 −2x + y ≤ 6 x ≥ 0, y ≥ 0 Minimum: P = x = y = Maximum: P = 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) = .
Solve the linear programming problem by the simplex method. (There may be more than one correct...
Solve the linear programming problem by the simplex method. (There may be more than one correct answer.) Maximize P = 5x + 5y + 6z subject to x + y + 5z ≤ 25 6x + 6y + 5z ≤ 220 x ≥ 0, y ≥ 0, z ≥ 0
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
Consider the following linear programming problem. Maximize P = 3x + 9y subject to the constraints...
Consider the following linear programming problem. Maximize P = 3x + 9y subject to the constraints 3x + 8y ≤ 1 4x − 5y ≤ 4 2x + 7y ≤ 6  x ≥ 0, y ≥  0 Write the initial simplex tableau. x y s1 s2 s3 P Constant 1 4 6 0
Use the method of corners to solve the linear programming problem. Find the maximum and minimum...
Use the method of corners to solve the linear programming problem. Find the maximum and minimum of Q = 3x + y subject to 5x + 2y ≥ 29 x + 2y ≥ 8 x + 4y ≤ 22 x ≥ 0, y ≥ 0. The minimum is P =   at (x, y) =   
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
ADVERTISEMENT
Need Online Homework Help?

Get Answers For Free
Most questions answered within 1 hours.

Ask a Question
ADVERTISEMENT