Question

1. Use the following table to determine the two numbers a and b that you will be using throughout this assessment. (a) Write3. (6 points) The graphical method still applies to this linear programming problem. A sketch of the feasible region, includi5. (1 point) Is si in the tableau in part 4 a slack variable or a surplus variable? 6. (2 points) By following the prompts at

0 0
Add a comment Improve this question Transcribed image text
Answer #1

Kindly go through the solution provided below.

2) LP problem: max. WE x-2y + 1oz St. 6 x + 3y +18 2 < 18 OY 2x + y + 6z ? 6 920 for w20, ,zzo as shown We can plot the feasi

Add a comment
Know the answer?
Add Answer to:
1. Use the following table to determine the two numbers a and b that you will...
Your Answer:

Post as a guest

Your Name:

What's your source?

Earn Coins

Coins can be redeemed for fabulous gifts.

Not the answer you're looking for? Ask your own homework help question. Our experts will answer your question WITHIN MINUTES for Free.
Similar Homework Help Questions
  • 1. Solving the linear programming problem Maximize z 3r1 2r2 3, subject to the constraints using ...

    1. Solving the linear programming problem Maximize z 3r1 2r2 3, subject to the constraints using the simplex algorithm gave the final tableau T4 T5 #210 1-1/4 3/8-1/812 0 0 23/4 3/8 7/8 10 (a) (3 points) Add the constraint -221 to the final tableau and use the dual simplex algorithm to find a new optimal solution. (b) (3 points) After adding the constraint of Part (a), what happens to the optimal solution if we add the fourth constraint 2+...

  • Based on this linear programming problem below, and answer the following questions: Minimize subject to Z=500...

    Based on this linear programming problem below, and answer the following questions: Minimize subject to Z=500 y, + 200 y, 3y, + y 24 -y, +2y, 210 y; - y, 215 -y, +4y, 225 y, 20, y, 20 and 1) Find the dual to the linear programming problem. 2) Using the simplex method to solve the dual problem. 3) The simplex method in part 2) should require 3 pivots (4 tableaus including the initial one). For each tableau, write the...

  • 1. -18 points TanFin11 4.1.002. Consider the following linear programming problem. Maximize P 4x + 7y...

    1. -18 points TanFin11 4.1.002. Consider the following linear programming problem. Maximize P 4x + 7y subject to the constraints -2x -3y 2-18 (a) Write the linear programming problem as a standard maximization problem. MaximizeP subject to s 12 s 18 (b) Write the initial simplex tableau Constant 12 18 0 Submit Answer Save Progress

  • Use the simplex method to solve the following maximum problem: Maximize P= x1 +2:02 Subject to...

    Use the simplex method to solve the following maximum problem: Maximize P= x1 +2:02 Subject to the constraints: 2x1 + x2 < 8 21 +2y < 5 X1 > 0 22 > 0 and using your final tableau answer the questions below by entering the correct answer in each blank box. Please enter fractions as 3/5, -4/7, and so on. 21 2 P=

  • Use the simplex method to solve the linear programming problem. Use the simplex method to solve...

    Use the simplex method to solve the linear programming problem. Use the simplex method to solve the linear programming problem. Maximize z = 8X, + 2X2 + x3 subject to: xy +3X2 + 9x2 = 107 Xq + 2xy + 10x3 = 243 with X120, X220, X3 20. Select the correct choice below and, if necessary, fill in the answer boxes to complete your choice. A. The maximum is O when xy = 1,x2 = O), and x3 = 41.4)....

  • Homework for section 4.3. Summer 2020 Math 116, section 70, Summer 1 2020 WebAssign 1.-12 Points...

    Homework for section 4.3. Summer 2020 Math 116, section 70, Summer 1 2020 WebAssign 1.-12 Points Harmathapit 4.3.003.MI Set Up The S... I Che MY NOTE 1. [-/18 Points) DETAILS HARMATHAP11 4.3.003.MI. Set up the simplex matrix used to solve the linear programming problem. Assume all variables are nonnegative. Maximize f = 5x + 7y subject to 6x + 7y S 300 x + 6y S 250. x y S; S2 first constraint second constraint objective function Need Help? Read...

  • same question just A through D steps (A) Introduce slack, surplus, and artificial variables and form...

    same question just A through D steps (A) Introduce slack, surplus, and artificial variables and form the modified problem. (B) Write the preliminary simplex tableau for the modified problem and find the initial simplex tableau. () Find the optimal solution of the modified problem by applying the simplex method to the initial simplex tableau. (D) Find the optimal solution of the original problem, it it exists. Maximize P-3xı + 5x2 subject to 2x1 + x2 58 X1 + X2 =...

  • 3. Consider the following production problem Maximize 10r 12r2 20r, subject to the constraints xi...

    3. Consider the following production problem Maximize 10r 12r2 20r, subject to the constraints xi +x2 +x3 10. ri + 2r2 +3rs 3 22, 2x1 2a2 +4x3 S 30 120, x2 20, 0 (a) (2 points) Solve the problem using the simplex method. Hint: Check your final tableau very carefully as the next parts will depend on its correct- ness. You will end up having 1, 2, r3 as basic variables. (b) (6 points) For1,2, and 3, determine the admissible...

  • 4.6-1.* Consider the following problem. Maximize Z= 2x1 + 3x2, subject to x1 + 2x2 54...

    4.6-1.* Consider the following problem. Maximize Z= 2x1 + 3x2, subject to x1 + 2x2 54 x1 + x2 = 3 and X120, X2 0. DI (a) Solve this problem graphically. (b) Using the Big M method, construct the complete first simplex tableau for the simplex method and identify the corresponding initial (artificial) BF solution. Also identify the initial entering basic variable and the leaving basic variable. I (c) Continue from part (b) to work through the simplex method step...

  • Solve the linear programming problem using the simplex method. Maximize z = 2X, + 5x, subject...

    Solve the linear programming problem using the simplex method. Maximize z = 2X, + 5x, subject to 5x, + X560 5x + 2x2 580 X1 + x2 $70 X1, X2 20. Select the correct choice below and, if necessary, fill in the answer box to complete your choice. O A. The maximum is z = when X, x2 = 1,5, - S2 = and s3 = B. There is no maximum solution for this linear programming problem.

ADVERTISEMENT
Free Homework Help App
Download From Google Play
Scan Your Homework
to Get Instant Free Answers
Need Online Homework Help?
Ask a Question
Get Answers For Free
Most questions answered within 3 hours.
ADVERTISEMENT
ADVERTISEMENT