please solve b part only 4. Consider the following problemMinimize Z= 2r1 + 3x2,subject to2r, + x: 2 250X + 3x 2 500andX1 2 0, x2 20(a) Use the simplex method to step-by-step solve the problem. Explicitly state the solution.(b) Use Excel's Solver to find the optimal solution to the problem. In your solution, include a screenshot of your Excel worksheet showing row numbers and column letters, a screen shot of the Solverwindow, and explicitly state the solution.

Create an Excel Model as given Below :

Answered: 4. Consider the following problem…

Practical Management Science

6th Edition

ISBN:9781337406659

Author:WINSTON, Wayne L.

Publisher:WINSTON, Wayne L.

Chapter7: Nonlinear Optimization Models

Section: Chapter Questions

Problem 59P

See similar textbooks

Similar questions

b) Consider the LP below:Solve using the big M- methodMinimize Z = 20X1 + 10X2s.t X1 + 2X2 ≤ 403X1 + X2 ≥ 304X1 + 3X2 ≥ 60X1, X2, ≥ 0
Analyze algebraically what special case in simplex application is present in each of the LP model below. Give an explanation to support your answer. a) Maximize z = 4x1 + 2x2 Subject to: 2x1 - x2 ≤ 2 3x1 - 4x2 ≤ 8 x1, x2 ≥ 0b) Maximize z = 3x1 + 2x2 Subject to: 4x1 - x2 ≤ 8 4x1 + 3x2 ≤ 12 4x1 + x2 ≤ 8 x1, x2 ≥ 0
Chapter 6. Solve the following Linear Program using the Solver method and answer the questions given below (round to two decimal places): Maximize 12A + 15B s.t. 3A + 7B <= 250 5A + 2B <= 200 B <= 25 A, B >= 0 a. The optimal value of A is 31.03 and the optimal value of B is 22.41. b. The maximized function yields a solution of 708.62. Chapter 7. For the problem you solved in Q1, obtain the Sensitivity Report, and answer the following questions. Remember to round to two digits and you can enter “infinity” for unlimited regions: The range for Variable A is from ????? to ????? The range for Variable B is from ????? to ????? The range for Constraint 1 is from ????? to ????? The range for Constraint 2 is from ????? to ????? The range for Constraint 3 is from ????? to ?????
Set up the simplex matrix used to solve the linear programming problem. Assume all variables are nonnegative. Maximize f = 8x + 9y + 3z subject to 2x + 7y + 8z ≤ 100 6x + 3y + z ≤ 160 3x + 4y + 9z ≤ 10 .
a. Maximize Z = 6X1 + 18X2+20X3 (Don't use excel shortcut solve manually by Simplex LPP method)Sub toX1 + X2 +X3 = 6010X1 +15X2 +20X3 = 9002X1 + 3X2 +3X3≤100And X1, X2, X3 >=0
b) Maximize Z = −40X1 −100X2s.t 10X1 + 5X2 ≤ 2502X1 + 5X2 ≤ 1002X1 + 3X2 ≤ 90X1, X2 ≥ 0Solve by simplex method, what are the solutions? Show that this problem hasmultiple solutions and find the solutions?
1. Explain your observations about the optimal solution returned by the Solver. 2. If the company has budget to increase the total capacity by 1,000 units, at which plant would you recommend them to expand? What would be total cost savings (i.e., potentially more reduction in the total costs) with this expansion? Refer to the sensitivity report and explain your answer. (Copy and paste the constraints section of the sensitivity report here.) 3. Suppose that the Atlanta plant had to reduce capacity by 1,000 units to repair and renovate. How much would this cause the total (optimized) transportation costs to increase? Refer to the sensitivity report and explain your answer. All i need is help with explaing these answers using the sensitivy reports and answer reports.
2) Max Z = 2X1 + 3X2 (Don't use excel shortcut solve manually by Simplex LPP method)Sub toX1 + 2X2 ≥ 5010X1 + 20X2 ≤ 175And X1, X2 ≥ 0
Please help with correct answers in details: step by step Q1 The optimal solution of this linear programming problem is at the intersection of constraints 1 and 2. Max 3x1 + x2 s.t. 4x1 + x2 ≤ 400 4x1 + 3x2 ≤ 600 x1 + 2x2 ≤ 300 x1, x2 ≥ 0 Over what range can the coefficient of x1 vary before the current solution is no longer optimal? (Round your answers to two decimal places.) ______ to ______? Over what range can the coefficient of x2 vary before the current solution is no longer optimal? (Round your answers to two decimal places.) _______ to _______? Compute the dual value for the first constraint. _______ Compute the dual value for the second constraint. _______ Compute the dual value for the third constraint. _______
Max Z = 6X1 + 18X2+20X3 Sub to X1 + X2 +X3 = 60 10X1 +15X2 +20X3 = 900 2X1 + 3X2 +3X3≤100 And X1, X2, X3 >=0 (SOLVE MANUALLY USING SIMPLEX METHOD PLEASE DON'T USE SHORTCUTS)
Use the simplex method to solve. Maximize z = 4x1 + 2x2, subject to 3x1 + x2 < 22 3x1 + 4x2 < 34 x1 > 0, x2 > 0 x1 = x2 = x3 =
The number of crimes in each of a city’s three policeprecincts depends on the number of patrol cars assigned toeach precinct (see Table 11). Five patrol cars are available.Use dynamic programming to determine how many patrolcars should be assigned to each precinct. No. of Patrol Cars Assigned to PrecinctPrecinct 0 1 2 3 4 51 14 10 7 4 1 02 25 19 16 14 12 113 20 14 11 8 6 5

SEE MORE QUESTIONS

Recommended textbooks for you

Practical Management Science

Operations Management

ISBN:

9781337406659

Author:

WINSTON, Wayne L.

Publisher:

Cengage,

Practical Management Science

Operations Management

ISBN:

9781337406659

Author:

WINSTON, Wayne L.

Publisher:

Cengage,

SEE MORE TEXTBOOKS

4. Consider the following problem Minimize Z= 2r, + 3x:, subject to 2r + x: 2 250 Xi + 3x 2 500 and X 20, x2 20