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
X1 19.286 25.000 45.000
X2 no lower limit 30.000 40.000
X3 8.333 15.000 50.000
RIGHT HAND SIDE RANGES
Constraint Lower Limit Current Value Upper Limit
1 666.667 1200.000 4000.000
2 450.000 1500.000 2700.000
a. Give the complete optimal solution.
b. Give the reduced costs? Explain fully its meaning.
c. What is the dual price for the second constraint? What interpretation does this have?
d. Over what range can the objective function coefficient of x2 vary before a new solution point becomes optimal?
e. By how much can the amount of resource 2 decrease before the dual price will change?
f. Which constraint(s) have a surplus ?Explain
f. Which constraint(s) have a slack ? Explain
Each value is less than the right side of the less than or equal to sign
g. Can this problem be solved using the graphical method?
h. What does the objective function value represent? (Give the breakdown to show how x1, x2 and x3 contribute to the objective function value).
SOLUTION
a) The optimal solution is following:
X1 = 140
X2 = 0
X3 = 80
Objective value = 4700
b) Slack/surplus for both constraints is 0. So both constraints are binding.
c) Dual price for second constraint is 2.33. It means a unit increase in RHS of this constraint will increase the objective value by 2.33 units
d) Range of optimality for objective coefficnt of x2 is no lower limit to 40 (upper limit)
e) lower limit for resource 2 is 450. Therefore, resource 2 can be decreased by 1500-450 = 1050.
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 questi...
Use this output to answer these questions please, I need to understand. 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 ST. 1) 4X1+5X2+8X3<1200 2) 9x1+15X2+3X3c1500 OPTIMAL SOLUTION: Objective Function Value- 4700.000 Variable Value 140.000 duced Costs 0.000 10.000 0.000 x1 x2 X3 0.000 80.000 Slack/Surplus 0.000 0.000 1.000 2.333 2 OBJECTIVE COEFFICIENT RANGES:...
I post this question but C, G, and H was not answered...can I have an answer for them please as soon as possible. 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 1) 4X1+5X2+8X3<1200 2) 9x1+15X2+3X3<1500 OPTIMAL SOLUTION: Objective Function Value- 4700.000 ariabl X1 x2 X3 0s 0.000 10.000 0.000 140.000 0.000 80.000 Less...
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...
Given the following output, what would happen if the coefficient of X2 increased by 1 LINEAR PROGRAMMING PROBLEM MAX 31X1+35X2+32X3 S.T 1) 3X1+5X2+2X3>90 2) 6X1 7X2+8X3<150 3) 5x1+3X2+3X3120 OPTIMAL SOLUTION Objective Function Value 763.333 Variable Value Reduced 13.333 0,000 10.000 0.000 0.000 10.889 X1 X2 X3 Constraint Slack/Surplus Dual Price 0.000 0.000 23.333 0.778 5.556 0.000 OBJECTIVE COEFFICIENT RANGES Lower Current Upper Limit Value Limit No X1 30.000 31000 Upper Limit No X2 Lower 35.000 36.167 Limit No Limit X3...
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...
8.) Hungry Birds, Inc. manufactures birdseed. One variety consists of wheat. They are trying to determine the optimal mix of buckwheat (X1), sunflower (X2), and poppy (X3) (each in lbs.). Relevant information is provided in the following table. In addition, the final mix is required to contain at least 500 lbs. of poppy. Also, the total weight of the buckwheat may not exceed the total weight of the sunflower in the final mix. Nutritional Item Proportional Content Total Requirement Buckwheat Sunflower Poppy Fat 0.04 0.06 0.05 480 Protein 0.12 0.10 0.10 1200 Roughage 0.10 0.15 0.07 1500 Cost/lb. $0.18 $0.10 $0.11 The...
S- In the optimal table of the simplex for the following linear programming problem x1, x3, are the basic variables. Min Z=-5X1+3X2+X3 X1+X2-X3<=10 X1+X2+X3<=60 What is the range for the first constraint right hand side for which the optimal table remains feasible? a. b. Is it profitable to increase a unit of resource for the 2nd constraint, if each unit of this resource is purchased for $2? What is the value of objective function and decision variables for this problem?...
Here is the sensitivity solution for the problem:OBJECTIVE FUNCTION VALUE6850.0000VARIABLEVALUEREDUCED COSTX1100.000000 0.000000X2 0.00000013.000000X3175.000000 0.000000X4 0.000000 2.000000ROWSLACK OR SURPLUSDUAL PRICE2)125.000000 0.0000003) 0.000000 8.0000004) 0.000000−10.000000RANGES IN WHICH THE BASIS IS UNCHANGED:OBJ. COEFFICIENT RANGESVARIABLECURRENTCOEFFICIENTALLOWABLEINCREASEALLOWABLEDECREASEX130.000000INFINITY 2.500000X225.000000 13.000000INFINITYX322.000000 2.000000 2.000000X420.000000 2.000000INFINITYRIGHTHAND SIDE RANGESROWCURRENTRHSALLOWABLEINCREASEALLOWABLEDECREASE2 500.000000INFINITY125.0000003 1200.000000125.000000100.0000004 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...
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...