3.Consider the following linear program:Min 8X + 12Ys.t.1X + 3Y > 92X + 2Y > 106X + 2Y > 18А, В 2 0a. Use the graphical solution procedure to find the optimal solution.b. Assume that the objective function coefficient for X changes from 8 to 6. Does the optimalsolution change? Use the graphical solution procedure to find the new optimal solution.c. Assume that the objective function coefficient for X remains 8, but the objective func-tion coefficient for Y changes from 12 to 6. Does the optimal solution change? Use thegraphical solution procedure to find the new optimal solution.d. The computer solution for the linear program in part (a) provides the following objec-tive coefficient range information:

Answered: Image /qna-images/answer/1ab008bf-603b-4cfd-85f8-c136a5307279.jpg

Use the graphical solution procedure to find the optimal solution. b. Assume that the objective function coefficient for X changes from 8 to 6. Does the optimal solution change? Use the graphical solution procedure to find the new optimal solution. Assume that the objective function coefficient for X remains 8, but the objective func- tion coefficient for Y changes from 12 to 6. Does the optimal solution change? Use the graphical solution procedure to find the new optimal solution. a. с.

Use the graphical solution procedure to find the optimal solution. b. Assume that the objective function coefficient for X changes from 8 to 6. Does the optimal solution change? Use the graphical solution procedure to find the new optimal solution. Assume that the objective function coefficient for X remains 8, but the objective func- tion coefficient for Y changes from 12 to 6. Does the optimal solution change? Use the graphical solution procedure to find the new optimal solution. a. с.

Practical Management Science

6th Edition

ISBN:9781337406659

Author:WINSTON, Wayne L.

Publisher:WINSTON, Wayne L.

Chapter11: Simulation Models

Section: Chapter Questions

Problem 68P

See similar textbooks

Similar questions

Maximize Profit=123 L + 136 S 17 L+11 S≤ 3000 6 L+9 S≤2500 L20 and S20 (Availability of component A) (Availability of component B) Show Transcribed Text Implement the linear optimization model and find an optimal solution. Interpret the optimal solution. The optimal solution is to produce LaserStop models and SpeedBuster models. This solution gives the possible profit, which is $. (Type integers or decimals rounded to two decimal places as needed.)
3. Consider the following linear program: Min 8X + 12Y s.t. IX +3Y 9 2X+ 2Y 10 6X + 2Y 18 XY 0 Use the graphical solution procedure to find the optimal solution. b. Assume that the objective function coefficient for X changes from 8 to 6. Does the optimal solution change? Use the graphical solution procedure to find the new optimal solution. a. Assume that the objective function coefficient for X remains 8, but the objective func- tion coefficient for Y changes from 12 to 6. Does the optimal solution change? Use the graphical solution procedure to find the new optimal solution. d. The sensitivity report for the linear program in part (a) provides the following objec- tive coefficient range information: C. Objective Coefficient Allowable Inerease Allowable Variable Decrease 8.000 12.000 4.000 12.000 4.000 4.000 How would this objective coelficient range information help you answer parts (b) and (C) prior to resolving the problem?
(d) A company has three factories. Each factory produces three different products (A, B and C). Factory 1 has a daily production capacity production of 8 units of A, 4 units of B and 8 units of C. Factory 2 has a daily production capacity of 6 units of A, 6 units of B and 3 units of C. Factory 3 has a production capacity of 12 units of A, 4 units of B and 8 units of C. The total demand for product A is 300 units, for product B is 172 units and for product C is 250 units. The daily operating cost for Factory 1 is $55 for Factory 2 is $60 and for Factory 3 is $50. How many days should each factory be operated in order to fill the total demand and the keep the operating cost at a minimum? (iv) (v) Identify the entering, departıng and pivot variables. Use the simplex method to determine the optimal tableau. Ensure that you explain each step in the computation. Identify the basic and non-basic variables. (vii) Identify the optimal solution. (vi)
(d) A company has three factories. Each factory produces three different products (A, B and C). Factory 1 has a daily production capacity production of 8 units of A, 4 units of B and 8 units of C. Factory 2 has a daily production capacity of 6 units of A, 6 units of B and 3 units of C. Factory 3 has a production capacity of 12 units of A, 4 units of B and 8 units of C. The total demand for product A is 300 units, for product B is 172 units and for product C is 250 units. The daily operating cost for Factory 1 is $55 for Factory 2 is $60 and for Factory 3 How many days should each factory be operated in order to fill the total demand and the keep the operating cost at a minimum? (i) (ii) (iii) $50. Show a model that represents the company's problem. Write down the dual maximization problem. Write down the initial simplex tableau.
do fast
9.5 Capital Healthplans Inc. is evaluating two different methods for providing home health services to its members. Both methods involve contracting out for services, and the health outcomes and revenues are not affected by the method chosen. Therefore, the net cash flows for the decision are all outflows. Here are the projected flows: Year Method A ($) Method B ($) 0 (300,000) (120,000) 1 (66,000) (96,000) 2 (66,000) (96,000) 3 (66,000) (96,000) 4 (66,000) (96,000) 5 (66,000) (96,000) What is each alternative’s IRR? If the opportunity cost of capital for both methods is 9 percent, which method should be chosen? Why?
LPP Model Maximize P = 12x + 10y Subject to : 4x + 3y < 480 2x + 3y < 360 X, y 2 0 Which of the following points (x, y) is feasible? A) ( 120, 10) B ( 30, 100 ) c) ( 60, 90 ) D) ( 10, 120 )
Fopic 4- Linear Programming: Appli eBook Problem 9-05 (Algorithmic) Kilgore's Deli is a small delicatessen located near a major university. Kilgore's does a large walk-in carry-out lunch business. The deli offers two luncheon chili specials, Wimpy and Dial 911. At the beginning of the day, Kilgore needs to decide how much of each special to make (he always sells out of whatever he makes). The profit on one serving of Wimpy is $0.46, on one serving of Dial 911, $0.59. Each serving of Wimpy requires 0.26 pound of beef, 0.26 cup of onions, and 6 ounces of Kilgore's special sauce. Each serving of Dial 911 requires 0.26 pound of beef, 0.41 cup of onions, 3 ounces of Kilgore's special sauce, and 6 ounces of hot sauce. Today, Kilgore has 21 pounds of beef, 16 cups of onions, 89 ounces of Kilgore's special sauce, and 61 ounces of hot sauce on hand. a. Develop a linear programming model that will tell Kilgore how many servings of Wimpy and Dial 911 to make in order to maximize his profit today.…
A survey was conducted to 12 first time voters on their preferred candidate. The results are: BBM, BBM, LR, IM, PL, PL, IM, IM, BBM, BBM, LR, LR. Which statement is true? The Borda score of PL is two points. BBM wins by plurality method. The Condorcet winner is IM. The modes are LR and IM Which of the following is a property of all linear programming problems? alternate courses of action to choose from minimization of some objectives a computer program usage of graphs in the solution
Consider the following LP problem: Min 6X+ 27Y Subject to : 2 X + 9Y => 25, and X + Y <= 75. Pick a suitable statement for this problem: a. X=37.5, Y=37.5 is the only optimal solution. b. Optimal Obj. function value is 75 c. X = 0, Y = 0 is the only optimal solution. d. Optimal Obj. function value is 0
3) Maximize Z= 2x, +x2 +3x 3 X+x2+2x3 <25 + X3 5 8 X2+ x3 S10 X1, X2, X3 2 0 Subject to IMe
do fast