Here is the sensitivity solution for the problem:
OBJECTIVE FUNCTION VALUE | ||||
6850.0000 | ||||
VARIABLE | VALUE | REDUCED COST | ||
X1 | 100.000000 | 0.000000 | ||
X2 | 0.000000 | 13.000000 | ||
X3 | 175.000000 | 0.000000 | ||
X4 | 0.000000 | 2.000000 | ||
ROW | SLACK OR SURPLUS | DUAL PRICE | ||
2) | 125.000000 | 0.000000 | ||
3) | 0.000000 | 8.000000 | ||
4) | 0.000000 | −10.000000 | ||
RANGES IN WHICH THE BASIS IS UNCHANGED: | |||||
OBJ. COEFFICIENT RANGES | |||||
VARIABLE | CURRENT | ALLOWABLE | ALLOWABLE | ||
X1 | 30.000000 | INFINITY | 2.500000 | ||
X2 | 25.000000 | 13.000000 | INFINITY | ||
X3 | 22.000000 | 2.000000 | 2.000000 | ||
X4 | 20.000000 | 2.000000 | INFINITY | ||
RIGHTHAND SIDE RANGES | |||||
| CURRENT | ALLOWABLE | ALLOWABLE | ||
2 | 500.000000 | INFINITY | 125.000000 | ||
3 | 1200.000000 | 125.000000 | 100.000000 | ||
4 | 275.000000 | 25.000000 | 35.000000 |
Based on the Sensitivity report provided, match the best response to the following questions:
1. What is the range of optimality for variable x3?
2. What is the upper limit of the feasibility region to the RHS of row 3 constraint that will maintain the dual price of $8?
3. If the coefficient of the variable x3 increases by $1, what is the added value to the objective function total value?
4. If the current coefficient of variable X1 drops to $28, what is the value of variable X1 ?
range of optimality for the Coeficient (C) of variable x3
What is the upper limit of the feasibility region to the RHS of row 3 constraint that will maintain the dual price of $8?
If the coefficient of variable X3 increases by $1, what is the added value to the Objective Function?
If the current coefficient of variable X1 drops to $28, what is the value of variable X1 ?
The following linear programming problem has been solved by LINDO. Use the output to answer the questions. (Scroll down to see all). LINEAR PROGRAMMING PROBLEM MAX 41X1+52X2+21X3 S.T. C.1) 5X1 + 5X2 + 9X3 < 1200 C.2) 11X1 + 14X2 + 5X3 < 1500 END LP OPTIMUM FOUND AT STEP 1 OBJECTIVE FUNCTION VALUE 1) 5795.049 VARIABLE VALUE REDUCED COST X1 0.000 0.217822 X2 74.247 0.000000 X3 92.079 0.000000 ROW SLACK OR SURPLUS DUAL...
3 Gepbab Production Company uses labor and raw material to produce three products. The resource requirements and sales price for the three products are as shown in Table 10. Currently, 60 units of raw material are available. Up to 90 hours of labor can be purchased at Sl per hour. To maximize Gepbab profits, solve the following LP: max z = 6X1 + 8X2 + 13X3 - L s.t. 3X1 + 4X2 + 6X3 - LS 0 2X1 + 2X2...
2) Buster Sod operates a 1200-acre irrigated farm in the Red River Valley of Arizona. Sod's principal activities are raising wheat, alfalfa, and beef. The Red Valley Water Authority has just given its water allotments for next year (Sod was allotted 2000 acre-feet) and Sod is busy preparing his production plan for the next year. It figures that beef prices will hold at around $600 per ton and wheat will sell at $1.60 per bushel. Best guesses are that it...
Use Computer Output 4. If you could increase the right hand side of one constraint by one unit, which one would you choose? constraint 1 constraint 4 constraint 2 constraint 3 Optimal Obj. Value 48,450 Z = Reduced Cost Variable Value 25 0 X1 425 10 X2 150 0 X3 0 -45 X4 Slack and Surplus Dual Value Constraint 1 0 3 2 25 0 0 60 0 -17 Obj. Coefficient Variable Allowable Allowable Decrease Increase 1E+30 90 6 X1...
Consider the following LP formulation of the modified Dog Food example you learned in class (by adding gruel 5). The objective coefficients represent unit costs ($ per 16 oz) for the gruels. The RHS’s represent the nutrition requirements (measured in oz). MIN 4 G1 + 6 G2 + 3 G3 + 2 G4 + 5 G5 SUBJECT TO 2) 3 G1 + 5 G2 + 2 G3 + 3 G4 + 4 G5 >= 3 (Protein Req.) 3) 7 G1...
Consider the following linear programming problem Manimize $45X1 + $10X2 Subject To 15X1 + 5X2 2 1000 Constraint A 20X1 + 4X2 > 1200 Constraint B X1, X2 20 Constraint C if A and B are the two binding constraints. a) What is the range of optimality of the objective function? 3 C1/C2 s 5 b) Suppose that the unit revenues for X1 and X2 are changed to $100 and $15, respectively. Will the current optimum remain the same? NO...
Given the following LP problem formulation and output data, perform the analysis below. Max. 100X1 + 120X2 + 150X3 + 125X4 s.t X1 + 2X2 + 2X3 + 2X4 < 108 (C1) 3X1 + 5X2 + X4 < 120 (C2) X1 + X3 < 25 (C3) X2 + X3 + X4 > 50 (C4) OPTIMAL SOLUTION: Objective Function Value = 7475.000 Variable Value Reduced Costs X1 8.000 0.500 X2 0.000 5.000 X3 17.000 0.000 X4 *A...
The LP problem whose output follows determines how many necklaces, bracelets, rings, and earrings a jewelry store should stock. The objective function measures profit; it is assumed that every piece stocked will be sold.Constraint 1 measures display space in units, constraint 2 measures time to set up the display in minutes. Constraints 3 and 4 are marketing restrictions. using excel solver: To what value can the profit on ring increases before the solution would change? LINEAR PROGRAMMING PROBLEM MAX 100X1+120X2+150X3+125X4...
Interpreting an LP output after solving the problem using the software. The following linear programming problem has been solved using the software. Use the output to answer the questions below. 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 Value Reduced Costs X1 140.000 0.000 X2 0.000 10.000 X3 80.000 0.000 Constraint Slack/Surplus Dual Prices 1 0.000 1.000 2 0.000 2.333 OBJECTIVE COEFFICIENT RANGES: Variable Lower Limit Current Value Upper Limit...
Exercise 2 Linear Programming 1. The Scrod Manufacturing Co. produces two key items – special-purpose Widgets (W) and more generally useful Frami (F). Management wishes to determine that mix of W & F which will maximize total Profits (P). Data W F Unit profit contributions $ 30 $ 20 Demand estimates (unit/week) 250 500 Average processing rates – each product requires processing on both machines (units/hour) Machine #1 2 4 Machine #2 ...