Question

In: Finance

Based on the following sensitivity results on constraints, what is the optimal LP solution for Products...

Based on the following sensitivity results on constraints, what is the optimal LP solution for Products 1 and 2?

Constraints
Cell Name Final
Value		 Shadow
Price		 Constraint
R.H. Side		 Allowable
Increase		 Allowable
Decrease
$B$11 Material (units) Quantity 1,050 0 1,300 1E+30 250
$B$12 Machine (hours) Quantity 525 0 750 1E+30 225
$B$13 Labor (hours) Quantity 900 0 1,400 1E+30 500
$B$15 Number of Product 1 Units Produced 300 5 300 125 300
$B$16 Number of Product 2 Units Produced 150 8 150 83.33333333 150

A: Product 1: 300 units and Product 2: 234 units

B: Product 1: 425 units and Product 2: 150 units

C: Product 1: 300 units and Product 2: 150 units

D: Product 1: 125 units and Product 2: 84 units

Solutions

Expert Solution

Option C

Based on the following sensitivity results on constraints, what is the optimal LP solution for Products 1 and 2?

Product 1: 300 units and Product 2: 150 units

jeff jeffy answered 2 years ago
Next > < Previous

Related Solutions

Identify the type of optimal solution for the following LP problems by the graphical solution method....
Identify the type of optimal solution for the following LP problems by the graphical solution method. Show your work (1)   Min    2X1 + 3X2             S.T.   2X1 - 2X2    <=   2                   -2X1 +   X2    <=   1                   X1 => 0,    X2 => 0 If the objective function of the above formulation is changed from Min 2X1 + 3X2 to Max 2X1 + 3X2, what type of optimal solution does this problem provide? Note that all constraints remain...
For the following LP problem, determine the optimal solution by the graphical solution method. Min Z=...
For the following LP problem, determine the optimal solution by the graphical solution method. Min Z= 3x1+2x2 Subject to 2x1+x2 >10                    -3x1+2x2 < 6                      X1+x2 > 6                      X1,x1 > 0 Graph and shade the feasible region
Solve the LP problem. If no optimal solution exists because there is no Solution Set, enter...
Solve the LP problem. If no optimal solution exists because there is no Solution Set, enter EMPTY. If no optimal solution exists because the region is unbounded, enter UNBOUNDED. Note that an unbounded region can still have an optimal solution while a bounded region is guaranteed to have optimal solutions. HINT [See Example 1.] Maximize and minimize p = x + 2y subject to x + y ≥ 4 x + y ≤ 10 x − y ≤ 4 x...
Solve the LP problem. If no optimal solution exists because there is no Solution Set, enter...
Solve the LP problem. If no optimal solution exists because there is no Solution Set, enter EMPTY. If no optimal solution exists because the region is unbounded, enter UNBOUNDED. Note that an unbounded region can still have an optimal solution while a bounded region is guaranteed to have optimal solutions. HINT [See Example 1.] Minimize c = 2x − 2y subject to x 6 ≤ y y ≤ 2x 3 x + y ≥ 10 x + 2y ≤ 35...
Using the simplex method, find the optimal solution to the following LP: A company manufactures three...
Using the simplex method, find the optimal solution to the following LP: A company manufactures three products, A,B, and C. The sales volume for A is at least 50% of the total sales of all three products. However, the company cannot sell more than 75 units of A per day. The three products use one raw material, of which the maximum daily availability is 240 pounds. The usage rates of the raw material are 2 lb per unit of A,...
The optimal solution of the linear programming problem is at the intersection of constraints 1 and...
The optimal solution of the linear programming problem is at the intersection of constraints 1 and 2. Please answer the following questions by using graphical sensitivity analysis. Max s.t. Max 2x1 + x2 s.t. 4x1 +1x2 ≤8 4x1 +3x2 ≤12 1x1 +2x2 ≤6 x1 , x2 ≥ 0 Over what range can the coefficient of x1 vary before the current solution is no longer optimal? Over what range can the coefficient of x2 vary before the current solution is no...
Graph the following LP problem and indicate the optimal solution point: Maximize profit= $3X + 2Y...
Graph the following LP problem and indicate the optimal solution point: Maximize profit= $3X + 2Y Subject to 2X+ Y ≤ 150 2X + 3Y ≤ 300 a) Does the optimal solution change if the profit per unit of X changes to $4.50? b ) What happens if the profit function should have been $3X + 3Y? I need help solving this problem using solver in excel
1. The optimal solution of the linear programming problem is at the intersection of constraints 1...
1. The optimal solution of the linear programming problem is at the intersection of constraints 1 and 2. Please answer the following questions by using graphical sensitivity analysis. Max 2x1 + x2 s.t. 4x1 +1x2 ≤8 4x1 +3x2 ≤12   1x1 +2x2 ≤6 x1 , x2 ≥ 0 A. Over what range can the coefficient of x1 vary before the current solution is no longer optimal? B. Over what range can the coefficient of x2 vary before the current solution is...
Solve the LP problem. If no optimal solution exists, indicate whether the feasible region is empty...
Solve the LP problem. If no optimal solution exists, indicate whether the feasible region is empty or the objective function is unbounded. HINT [See Example 1.] (Enter EMPTY if the region is empty. Enter UNBOUNDED if the function is unbounded.) Minimize c = 0.2x + 0.3y subject to 0.2x + 0.1y ≥ 1 0.15x + 0.3y ≥ 1.5 10x + 10y ≥ 80 x ≥ 0, y ≥ 0. c = (x, y) =
solve the following LP. Formulate and algebraically solve the problem. what is the new optimal z...
solve the following LP. Formulate and algebraically solve the problem. what is the new optimal z value show that the current basis is optimal max z=65x1+25x2+20x3 8x1+6x2+x3<=48 4x1+2x2+1.5x3<=20 2x1+1.5x2+0.5x3<=8 x2<=5 x1,x2,x3>=0
ADVERTISEMENT
Subjects
ADVERTISEMENT
Latest Questions
ADVERTISEMENT