Question

solve the following model graphically: maximize 2x1 +7x2 subject to: 9x1 +7x2 ≤ 63 5x1 +8x2...

solve the following model graphically:

maximize 2x1 +7x2

subject to:

9x1 +7x2 ≤ 63
5x1 +8x2 ≤ 40
9x1 −15x2 ≥ 0
x1 ≥ 3 x2 ≤ 4
x1, x2 ≥ 0
Take care to identify and label the feasible region, feasible points, optimal isovalue line and use algebra to determine the optimal solution.

Math   Statistics-And-Probability   
0 0
Add a commentTranscribed image text
Next >

Homework Answers

Answer #1

Please like ??

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
a. Solve the following linear programming model by using the graphical method: graph the constraints and...
a. Solve the following linear programming model by using the graphical method: graph the constraints and identify the feasible region then determine the optimal solution (s) (show your work). Minimize Z = 3x1 + 7x2 Subject to 9x1 + 3x2 ≥ 36 4x1 + 5x2 ≥ 40 x1 – x2 ≤ 0 2x1 ≤ 13 x1, x2 ≥ 0 b. Are any constraints binding? If so, which one (s)?
minimize F=5x1 - 3x2 - 8x3    subject to (2x1 + 5x2 - x3 ≤1) (-2x1...
minimize F=5x1 - 3x2 - 8x3    subject to (2x1 + 5x2 - x3 ≤1) (-2x1 - 12x2 + 3x3 ≤9) (-3x1 - 8x2 + 2x3 ≤4) x1,x2,x3≥0 solve implex method pls.
Solve the following linear programming model graphically and mathematically. Minimize C = 8x1 + 2x2 Subject...
Solve the following linear programming model graphically and mathematically. Minimize C = 8x1 + 2x2 Subject to 2x1 – 6x2 ≤ 12 5x1 + 4x2 ≥ 40 x1 +2x2 ≥ 12 x2 ≤ 6 x1, x2 ≥ 0
Use the simplex method to solve: Maximize z=100x1+200x2+50x3, subject to: 5x1+5x2+10x3 ≤ 1,000 10x1+8x2+5x3 ≤ 2,000...
Use the simplex method to solve: Maximize z=100x1+200x2+50x3, subject to: 5x1+5x2+10x3 ≤ 1,000 10x1+8x2+5x3 ≤ 2,000 10x1+5x2+0x3 ≤ 500 x1 ≥ 0, x2 ≥ 0, x3 ≥ 0. x1= x2= x3= z=
Solve the following linear programming model by using the graphical method: graph the constraints and identify...
Solve the following linear programming model by using the graphical method: graph the constraints and identify the feasible region. Using the corner points method, determine the optimal solution (s) (show your work). Maximize Z = 6.5x1 + 10x2 Subject to x1 + x2 ≤ 15 2x1 + 4x2 ≤ 40 x1 ≥ 8 x1, x2 ≥ 0 b. If the constraint x1 ≥ 8 is changed to x1 ≤ 8, what effect does this have on the optimal solution? Are...
For the following linear programming problem:    Maximize 2x1+ 3x2    Such that        x1+ x2...
For the following linear programming problem:    Maximize 2x1+ 3x2    Such that        x1+ x2 ≤ 4      5x1+ 3x2 ≤15       x1,x2 ≥ 0 Graph the region that satisfies the constraints. Find the optimal solution and the value of the objective function at the optimal solution.
Solve the following LP problem graphically; confirm your results using Solver in MS Excel. Maximize profit...
Solve the following LP problem graphically; confirm your results using Solver in MS Excel. Maximize profit = 20x1 + 10x2 Subject to: 5x1 + 4x2 ≤ 250 2x1 + 5x2 ≤ 150 x1, x2 ≥ 0
Max Z   = 2x1 + 8x2 + 4x3 subject to 2x1 + 3x2 ≤ 8 2x2...
Max Z   = 2x1 + 8x2 + 4x3 subject to 2x1 + 3x2 ≤ 8 2x2 + 5x3 ≤ 12 3x1 + x2 + 4x3   ≤15 and x1,x2,x3≥0; Verify that your primal and dual solutions are indeed optimal using the Complementary Slackness theorem.
Solve the following linear programming model graphically and explain the solution result. Maximize Z = 60x1...
Solve the following linear programming model graphically and explain the solution result. Maximize Z = 60x1 + 90x2 Subject to 60x1 + 30x2 <= 1500 100x1 + 100x2 >= 6000 x2 >= 30 x1, x2 >= 0
Solve the following linear programs graphically. Minimize            Z = 6X1 - 3X2 Subject to            2X1 +...
Solve the following linear programs graphically. Minimize            Z = 6X1 - 3X2 Subject to            2X1 + 5X2 ≥ 10                             3X1 + 2X2 ≤ 40                            X1, X2 ≤ 15
ADVERTISEMENT
Need Online Homework Help?

Get Answers For Free
Most questions answered within 1 hours.

Ask a Question
ADVERTISEMENT