Question

) Consider the linear program in Problem 1. The value of the optimal solution is 27....

) Consider the linear program in Problem 1. The value of the optimal solution is 27. Suppose that the right-hand side for constraint 1 is increased from 10 to 11.

a. Use the graphical solution procedure to find the new optimal solution.

b. Use the solution to part (a) to determine the shadow price for constraint 1.

c. The sensitivity report for the linear program in Problem 1 provides the following right- hand-side range information:

Constraint

Constraint R.H side

Allowable Increase

Allowable Decrease

1

10,000

1,200

2000

2

24,000

6,000

6,000

3

16,000

Infinite

3,000

What does the right-hand-side range information for constraint 1 tell you about the shadow price for constraint 1?

D). The shadow price for constraint 2 is 0.5. Using this shadow price and the right-hand- side range information in part (c), what conclusion can you draw about the effect of changes to the right-hand side of constraint 2?

Homework Answers

Answer #1

Thanks.

Know the answer?
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
Similar Questions
1. Consider the following linear programming problem formulated by a team of business analysts at the...
1. Consider the following linear programming problem formulated by a team of business analysts at the JORDANA Company Inc. Max 3A+4B s.t. -1A + 2B ≤ 8 Constraint 1 1A +2B ≤ 12 Constraint 2 2A + 1B ≤ 16 Constraint 3 (a) Show the feasible region using the geometric or graphical approach. (b) What are the optimal values of the decision variables? (c) Find the optimal solution to this optimization problem.
Consider the following linear program: Max 3A + 2B 1A+1B<=10 3A+ 1B<=24 1A+2B<=16 A) Run the...
Consider the following linear program: Max 3A + 2B 1A+1B<=10 3A+ 1B<=24 1A+2B<=16 A) Run the syntax for the LINDO results. B) Assume that the objective function coefficient for A changes from 3 to 3.8 and the objective function coefficient for B changes from 2 to 1.2.   Does the optimal solution change? Show the calculation based on 100% rule on objective function. C) Assume that the right hand side of Constraint 2 changes from 24 to 28 and Constraint 3...
2. The following linear programming problem has been solved by The Management Scientist. Use the output...
2. The following linear programming problem has been solved by The Management Scientist. Use the output to answer the questions. LINEAR PROGRAMMING PROBLEM MAX 25X1+30X2+15X3 S.T. 1) 4X1+5X2+8X3<1200 2) 9X1+15X2+3X3<1500 OPTIMAL SOLUTION Objective Function Value = 4700.000 Variable Variable Reduced Cost X1 140.000   0.000 X2 0.000 10.000 X3 80.000 0.000 Constraint   Slack/Surplus Dual Price 1   0.000   1.000 2 0.000 2.333 OBJECTIVE COEFFICIENT RANGES Variable   Lower Limit Current Value Upper Limit X1 19.286 25.000 45.000 X2 No Lower Limit 30.000 40.000...
Variable Cells Final Reduced Objective Allowable Allowable Cell Name Value Cost Coefficient Increase Decrease $B$2 DVs...
Variable Cells Final Reduced Objective Allowable Allowable Cell Name Value Cost Coefficient Increase Decrease $B$2 DVs Standard 0 0 25 7.5 17.77777778 $C$2 DVs Deluxe 20 0 65 160 15 Constraints Final Shadow Constraint Allowable Allowable Cell Name Value Price R.H. Side Increase Decrease $D$4 Standard Leather 0 0 210 1E+30 210 $D$5 Premium leather 180 2.142857143 180 0 105 $D$6 Cutting and Sewing 80 0 120 1E+30 40 $D$7 Finishing 40 22.85714286 40 12.17391304 0 Consider the RHS sensitivity...
Leads to the formulation: Please show sensitivity report a. What is the optimal solution, and what...
Leads to the formulation: Please show sensitivity report a. What is the optimal solution, and what are the optimal production quantities? b. Specify the objective coefficient ranges. c. What are the shadow prices for each constraint? Interpret each. d. Identify each of the right-hand-side ranges Max s.t. 1W 1.25M 5W+ 7M < 4480 Whole tomatoes 3W+1M<2080 tomato sauce 2w+2m<1600 tomato paste Please show all work using excel and solver , I need to see how you got the formulas breakdown...
1) Describe "Sensitivity Analysis" within the Linear Programming context. Why is sensitivity analysis important? 2) Discuss...
1) Describe "Sensitivity Analysis" within the Linear Programming context. Why is sensitivity analysis important? 2) Discuss the impact of the changes in the following to your optimal solution: objective function coefficient resources or right-hand-side values. I need at least 200 words
1- An unbounded problem is one for which ________. remains feasible A. the objective is maximized...
1- An unbounded problem is one for which ________. remains feasible A. the objective is maximized or minimized by more than one combination of decision variables B. there is no solution that simultaneously satisfies all the constraints C. the objective can be increased or decreased to infinity or negative infinity while the solution D. there is exactly one solution that will result in the maximum or minimum objective 2- If a model has alternative optimal solutions, ________. A. the objective...
1. It is impossible for a linear program with unbounded feasible region to have a unique...
1. It is impossible for a linear program with unbounded feasible region to have a unique optimal solution. True or False? 2. It is impossible for an integer program to have infinitely many optimal solutions. True or False? 3. When we solve an integer program with a minimization objective using Branch and Bound, we can discard a subproblem for which the optimal objective value of the associated LP is larger than the objective value of the incumbent solution. True or...
Consider the following linear programming problem Maximize $1 X1 + $3 X2 Subject To X1 +...
Consider the following linear programming problem Maximize $1 X1 + $3 X2 Subject To X1 + X2 ≤ 4 Constraint A X1 - X2 ≤ 1 Constraint B X1, X2 ≥ 0 Constraint C Note: Report two digits after the decimal point. Do NOT use thousands-separators (,) 1 - Which of the following is the correct standard maximization form for the above linear programming problem Answer CorrectNot Correct Answer CorrectNot Correct Answer CorrectNot Correct Answer CorrectNot Correct Z - X1...
A factory produces cakes, pies, rolls and danishes. The resources required are flour, sugar, meat and...
A factory produces cakes, pies, rolls and danishes. The resources required are flour, sugar, meat and fruit. The following table shows the per-unit resource quantities required for each product, the price we sell each product for, the per-unit resource prices, and the resource quantities available to us for purchase: Products Resources Selling price flour sugar meat fruit cakes 0.500 0.900 0.000 0.100 $8.40 pies 0.430 0.090 0.500 0.000 $20.21 rolls 0.250 0.015 0.000 0.000 $1.45 danishes 0.180 0.290 0.000 0.050...