Use the following Management Scientist output to answer the questions.
LINEAR PROGRAMMING PROBLEM
MAX 31X1+35X2+32X3
S.T.
|
|
|
|
|
OPTIMAL SOLUTION
Objective Function Value = 763.333
|
Variable |
Value |
Reduced Cost |
|
X1 |
13.333 |
0.000 |
|
X2 |
10.000 |
0.000 |
|
X3 |
0.000 |
10.889 |
|
Constraint |
Slack/Surplus |
Dual Price |
|
1 |
0.000 |
|
|
2 |
0.000 |
5.556 |
|
3 |
23.333 |
0.000 |
OBJECTIVE COEFFICIENT RANGES
|
Variable |
Lower Limit |
Current Value |
Upper Limit |
|
X1 |
30.000 |
31.000 |
No Upper Limit |
|
X2 |
No Lower Limit |
35.000 |
36.167 |
|
X3 |
No Lower Limit |
32.000 |
42.889 |
RIGHT HAND SIDE RANGES
|
Constraint |
Lower Limit |
Current Value |
Upper Limit |
|
1 |
77.647 |
90.000 |
107.143 |
|
2 |
126.000 |
150.000 |
163.125 |
|
3 |
96.667 |
120.000 |
No Upper Limit |
|
a. |
Give the solution to the problem. |
|
b. |
Which constraints are binding? |
|
c. |
What would happen if the coefficient of x1 increased by 3? |
|
d. |
What would happen if the right-hand side of constraint 1
increased by 10? |
Ans a)
The solution to the problem is as follows
X1 = 13.333
X2 = 10
X3 = 0
The value of the objective function is 763.333
Ans b)
Constraints that have a non-zero dual price are known as binding constraints. Constraint 1 and constraint 2 have a non zero dual price. Hence they are binding constraints.
Ans c)
If the coefficient of X1 is increased by 3, there will be no change in the optimal solution. This is because the coefficient of X1 has an allowable increase of infinity. Thus any increase in the value of the coefficient of X1 would not result in the change of the optimal solution. The objective function value will increase as the coefficient increases.
Ans d)
If the right-hand side of constraint 1 increased by 10, its value will increase from 90 to 100. This lies within the upper limit for the right-hand side of constraint 1, which is 107.143
Hence there will be no change in the optimal solution as well as the objective function value.
Use the following Management Scientist output to answer the questions. LINEAR PROGRAMMING PROBLEM MAX 31X1+35X2+32X3 S.T....
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...
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...
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:...
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 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...
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...
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...
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?...
Use the following linear regression equation to answer the questions. x1 = 1.4 + 3.7x2 – 8.3x3 + 1.8x4 (c) If x2 = 2, x3 = 6, and x4 = 10, what is the predicted value for x1? (Use 1 decimal place.) Suppose x3 and x4 were held at fixed but arbitrary values and x2 increased by 1 unit. What would be the corresponding change in x1? Suppose x2 increased by 2 units. What would be the expected change in...
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...