Question

In: Operations Management

Consider the following linear programming problem Maximize $4X1 + $5X2 Subject To 2X1 + 5X2 ≤...

Consider the following linear programming problem

Maximize $4X1 + $5X2
Subject To 2X1 + 5X2 ≤ 40 hr

Constraint A

3X1 + 3X2 ≤ 30 hr

Constraint B

X1, X2 ≥ 0

Constraint C

if A and B are the two binding constraints.

(Round to ONLY two digits after decimal points)

a) What is the range of optimality of the objective function?

  Answer ≤ C1/C2  ≤  Answer

b) Suppose that the unit revenues for X1 and X2 are changed to $100 and $18, respectively. Will the current optimum remain the same?

AnswerYesNO that because the new C1/C2 is Answer which is Answerwithinnot within the range of optimality

c) Suppose that the unit revenue of X1 is fixed $4. What is the associated range for the unit revenue for X2 that will keep the optimum unchanged?

   Answer  ≤ C2 ≤  Answer

d) The Shadow Price for Constraint A is Answer.

e) The Shadow Price for Constraint B is Answer

f) If only the capacity of Constraint A is increased from the present 40 hours to 45 hours, The increase in revenue will be = $Answer

g) A suggestion is made to increase the capacities of Constraint A and B by an hour at the additional cost of $1/hr. Is this advisable?

This is advisable for AnswerConstraint AConstraint BBoth Constraints and the total additional net revenue per hour would be $Answer

Solutions

Expert Solution

a)

A and B are binding constraints. Therefore, ratio of objective function coefficients (C1/C2) must be between the ratio of coefficients of binding constraints. Therefore,

Range of optimality of the objective function is:

2/5 <= C1/C2 <= 3/3

or,

0.4 <= C1/C2 <= 1

------------------------------------------------------------------

b)

No, that because the new C1/C2 is 100/18 = 5.56 , which is not within the range of optimality.

------------------------------------------------------------------

c)

The range of optimality for C2 is

4/1 <= C2 <= 4/0.4

or,

4 <= C1 <= 10

------------------------------------------------------------------

e)

Using Excel Solver

Create Excel model as follows:

Enter Solver Parameters as follows:

Click Solve to generate the solution.

In the next window, check Sensitivity to generate the sensitivity report

and click OK

Result:

Sensitivity report :

d)

Shadow prices are read from the sensitivity report,

The shadow price for constraint A is : 0.333 ,

And the feasibility range is :  40-20 = 20 <= Constraint A <= 40+10 = 50

Feasibility range is determined by adding allowable increase and subtracting allowable decrease from the Constraint R.H. Side

e)

The shadow price for constraint B is : 1.111 ,

And the feasibility range is : 30-6 = 24 <= Constraint A <= 30+30 = 60

Feasibility range is determined by adding allowable increase and subtracting allowable decrease from the Constraint R.H. Side


Related Solutions

Consider the following linear programming problem Maximize $4X1 + $5X2 Subject To 2X1 + 5X2 ≤...
Consider the following linear programming problem Maximize $4X1 + $5X2 Subject To 2X1 + 5X2 ≤ 40 hr Constraint A 3X1 + 3X2 ≤ 30 hr Constraint B X1, X2 ≥ 0 Constraint C if A and B are the two binding constraints. (Round to ONLY two digits after decimal points) a) What is the range of optimality of the objective function?   .......... ≤ C1/C2  ≤  ............ b) Suppose that the unit revenues for X1 and X2 are changed to $100 and...
     Consider the following problem     Maximize Z=2x1 + 5x2 + x3 subject to                4x1+...
     Consider the following problem     Maximize Z=2x1 + 5x2 + x3 subject to                4x1+ 2x2 + x3 ≤ 6                 x1 + x2 ≤ 2                 xi ≥ 0 for i=1,2,3 a. Inserting slack variables, construct the initial simplex tableau. What is the initial basic feasible solution? b. What is the next non-basic variable to enter the basis c. Using the minimum ratio rule, identify the basic variable to leave the basis. d. Using elementary row operations, find...
Consider the following linear programming problem Maximize 6x1 + 4x2 + 5x3 Subject to: 2x1 +...
Consider the following linear programming problem Maximize 6x1 + 4x2 + 5x3 Subject to: 2x1 + 3x2 + x3 ≥ 30 2x1 + x2 + x3 ≤ 50 4x1 + 2x2 + 3x3 ≤ 120 x1, x2, x3 ≥ 0 a) Find the optimal solution by using simplex method b) Find the dual price for the first constraint. c) Find the dual price for the second constraint. d) Find the dual price for the third constraint. e) Suppose the right-hand...
Maximize $4X1 + $8X2 Subject To 2X1 + 5X2 ≤ 50 3X1 + 3X2 ≤ 48...
Maximize $4X1 + $8X2 Subject To 2X1 + 5X2 ≤ 50 3X1 + 3X2 ≤ 48 X1, X2 ≥ 0 what the optimal ??
For the following linear programming problem:    Maximize z = 2x1+ x2    Such that     ...
For the following linear programming problem:    Maximize z = 2x1+ x2    Such that      x1+ 2x2 ≤ 12          x2 ≥ 3       x1,x2 ≥ 0 (a) Write the first two constraints in equation form by adding slack or subtracting excess (surplus) variables. (b)Find all basic solutions for this LP (c) Which of these solutions are feasible? (d)Which of these feasible solutions is optimal? Find the optimal value of z
Consider the following linear programming problem: Maximize 16X + 14Y Subject to: 3X + 4Y ≤...
Consider the following linear programming problem: Maximize 16X + 14Y Subject to: 3X + 4Y ≤ 520 3X + 2Y ≤ 320 all variable ≥ 0 The maximum possible value for the objective function is
Consider the following linear programming problem: Maximize 10X + 8Y Subject to: 40X + 24Y <=...
Consider the following linear programming problem: Maximize 10X + 8Y Subject to: 40X + 24Y <= 600 20X + 30Y <= 480 all variables >= 0
Consider the following linear programming problem Maximize $1 X1 + $2 X2 Subject To 2 X1...
Consider the following linear programming problem Maximize $1 X1 + $2 X2 Subject To 2 X1 + X2 ≤ 8 Constraint A X1 + X2 ≤ 5 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 AnswerCorrectNot Correct AnswerCorrectNot Correct AnswerCorrectNot Correct AnswerCorrectNot Correct Z -X1 - 2 X2 =...
Please explain Question 1 Consider the following linear programming problem: Maximize 3.5x1 + 7x2 Subject to...
Please explain Question 1 Consider the following linear programming problem: Maximize 3.5x1 + 7x2 Subject to 4x1 + 3x2 > =12 -4x1 - 6x2 =< 12 x2 > =3 x1, x2 > 0 The above linear programming problem: exhibits unboundedness Question 2 Consider the following linear programming Minimize 6x1 + 4x2 Subject to 5x1 + 3x2 =< 15 6x1 + 8x2 > =48 x2 > =6 x1, x2 > 0 The above linear programming problem: exhibits infeasibility
The objective of a linear programming problem is to maximize 1.50A + 1.50B, subject to 3A...
The objective of a linear programming problem is to maximize 1.50A + 1.50B, subject to 3A + 2B ≤ 600, 2A + 4B ≤ 600, 1A + 3B ≤ 420, and A,B ≥ 0. Using Lingo software determine the optimal product mix for this problem? (include Lingo output) Please use excel! Thanks!
ADVERTISEMENT
ADVERTISEMENT
ADVERTISEMENT