OPERATIONS RESEARCH >INTERNATIONAL EDITI
OPERATIONS RESEARCH >INTERNATIONAL EDITI
4th Edition
ISBN: 9780534423629
Author: WINSTON
Publisher: CENGAGE L
Question
Book Icon
Chapter 6, Problem 29RP
Program Plan Intro

Optimal solution:

  • Consider the linear programming problem given below:
  • max z= 13x1+16x2+16x3+14x4+39x5
  • Subject to constraints:
    • 11x1+53x2+5x3+5x4+29x540
    • 3x1+6x2+5x3+x4+34x520
    • x1,x2,x3,x4,x51
    • x1,x2,x3,x4,x50
  • Here,
  • xi= Fraction of investment I purchased by star oil.
  • The Lindo output of the LP is given in the following figure:
  • LP optimum found at step 5
  • Objective function value: 57.44902.
VariableValueReduced Cost
x11.0000000.000000
x20.2008600.000000
x31.0000000.000000
x41.0000000.000000
x50.2880840.000000
RowSlack or SurplusDual prices
10.0000000.190418
20.0000000.984644
30.0000007.951474
40.7991400.000000
50.00000010.124693
60.00000012.063268
70.7119160.000000
  • Number of iterations: 5
  • Ranges in which the basis is unchanged:
Obj coefficient ranges
VariableCurrent coefficientAllowable increaseAllowable Decrease
x113.000000Infinity7.951474
x216.00000045.1045279.117647
x316.000000Infinity10.124693
x414.000000Infinity12.063268
x539.00000051.66666830.245285
Right-hand side ranges
RowCurrent RHSAllowable increaseAllowable Decrease
140.00000038.2647069.617647
220.00000011.2758638.849056
31.0000001.1393731.000000
41.000000Infinity0.799140
51.0000001.9957451.000000
61.0000002.3191491.000000
71.000000Infinity0.711916

Explanation of Solution

b.

  • If NPV from investment 1 changes to $5 from $13 then the objective function coefficient of x1 changes.
  • As it can be seen from the Lindo output, the Obj coefficient ranges block determines

Explanation of Solution

c.

  • Since both the objective function coefficients have a reduced cost of zero, hence 100% rule can be applied.
  • A 25% decrease in the NPV from investment 2 implies
    • Δb1=10I1=38.26
    • Δc2=4
  • Allowable decrease corresponding to c2=16, as it can be observed from the Lindo output is D2=7.95
  • Now applying the formula,
    • rj=ΔcjDj
    • Here,
    • r2=47.95
    • r2=0.50
  • In the same way, a 25% decrease in the NPV from investment 4 implies
    • Δc4=14(0.25)
    • Δc4=3

Explanation of Solution

d.

  • Since both the constraints are the binding constraints, hence 100% rule can be applied.
  • Since the amount available to invest in the time 0 is increased from $40 million to $50 million,
    • D2=8.85
    • Δb1=10
  • Allowable increase corresponding to b1=40, as can be seen from the Lindo output is,
    • I1=38.26
  • Now applying the formula
    • r2=0.56
    • Here,
    • r1=1038.26
    • r1=0.26
  • Similarly, since the amount available to invest in time 1 is decreased from $20 million to $15 million,
    • Δb1=1520
    • Δb1=5
  • Allowable decrease corresponding to b2=20, as can be seen from the Lindo output is D2=8

Explanation of Solution

e.

  • Define RM2 to be the pounds of raw material 2 purchased annually. The initial table is now changed by the introduction of the RM2 column. New linear program is,
    • max z=13x1+16x2+16x3+14x4+39x5
  • Subject to constraints:
    • 11x1+53x2+5x3+5x4+29x540
    • 3x1+6x2+5x3+x4+34x520
    • x1,x2,x3,x4,x51
    • x1,x2,x3,x4,x50
  • To determine whether a new activity causes the current basis to be optimal or not, price out the new activity. That is calculate c¯j by applying the formula given below:
  • c¯j=cBVB1ajcj
  • The new column for the investment 6 is
  • a6=[51000000] and cBVB1=[0

Blurred answer
Students have asked these similar questions
Create a static function in C# where poachers appear and attempt to hunt animals. It gets the location of the closest animal to itself. Take account of that the animal also move too, so it should update the closest location (x, y) everytime it moves to a new location. Use winforms to show the movements of poachers.
Create a static function in C# where poachers appear and attempt to hunt animals. It gets the location of the closest animal to itself. Take account of that the animal also moves too, so it should update the closest location (x, y) everytime it moves to a new location. Use winforms to show to movements
I have to develop an efficient parallel numerical integration program on a 2-D mesh but I'm struggling. And it has to be in Cstar

Chapter 6 Solutions

OPERATIONS RESEARCH >INTERNATIONAL EDITI

Ch. 6.3 - Prob. 4PCh. 6.3 - Prob. 5PCh. 6.3 - Prob. 6PCh. 6.3 - Prob. 7PCh. 6.3 - Prob. 8PCh. 6.3 - Prob. 9PCh. 6.4 - Prob. 1PCh. 6.4 - Prob. 2PCh. 6.4 - Prob. 3PCh. 6.4 - Prob. 4PCh. 6.4 - Prob. 5PCh. 6.4 - Prob. 6PCh. 6.4 - Prob. 7PCh. 6.4 - Prob. 8PCh. 6.4 - Prob. 9PCh. 6.4 - Prob. 10PCh. 6.4 - Prob. 11PCh. 6.4 - Prob. 12PCh. 6.4 - Prob. 13PCh. 6.5 - Prob. 1PCh. 6.5 - Find the duals of the following LPs: Ch. 6.5 - Prob. 3PCh. 6.5 - Prob. 4PCh. 6.5 - Prob. 5PCh. 6.5 - Prob. 6PCh. 6.6 - Prob. 1PCh. 6.6 - Prob. 2PCh. 6.7 - Prob. 1PCh. 6.7 - Prob. 2PCh. 6.7 - Prob. 3PCh. 6.7 - Prob. 4PCh. 6.7 - Prob. 5PCh. 6.7 - Prob. 6PCh. 6.7 - Prob. 7PCh. 6.7 - Prob. 8PCh. 6.7 - Prob. 9PCh. 6.8 - Prob. 1PCh. 6.8 - Prob. 2PCh. 6.8 - Prob. 3PCh. 6.8 - Prob. 4PCh. 6.8 - Prob. 5PCh. 6.8 - Prob. 6PCh. 6.8 - Prob. 8PCh. 6.8 - Prob. 9PCh. 6.8 - Prob. 10PCh. 6.8 - Prob. 11PCh. 6.9 - Prob. 1PCh. 6.9 - Prob. 2PCh. 6.9 - Prob. 3PCh. 6.10 - Prob. 1PCh. 6.10 - Prob. 2PCh. 6.10 - Prob. 3PCh. 6.11 - Prob. 1PCh. 6.11 - Prob. 3PCh. 6.11 - Prob. 4PCh. 6.12 - Prob. 5PCh. 6.12 - Prob. 6PCh. 6.12 - Prob. 7PCh. 6 - Prob. 1RPCh. 6 - Prob. 2RPCh. 6 - Prob. 3RPCh. 6 - Prob. 4RPCh. 6 - Prob. 5RPCh. 6 - Prob. 6RPCh. 6 - Prob. 7RPCh. 6 - Prob. 8RPCh. 6 - Prob. 9RPCh. 6 - Prob. 10RPCh. 6 - Prob. 11RPCh. 6 - Prob. 13RPCh. 6 - Prob. 14RPCh. 6 - Prob. 15RPCh. 6 - Prob. 17RPCh. 6 - Prob. 18RPCh. 6 - Prob. 19RPCh. 6 - Prob. 20RPCh. 6 - Prob. 21RPCh. 6 - Prob. 22RPCh. 6 - Prob. 25RPCh. 6 - Prob. 29RPCh. 6 - Prob. 33RPCh. 6 - Prob. 34RPCh. 6 - Prob. 35RPCh. 6 - Prob. 36RPCh. 6 - Prob. 37RP
Knowledge Booster
Background pattern image
Similar questions
SEE MORE QUESTIONS
Recommended textbooks for you
Text book image
Operations Research : Applications and Algorithms
Computer Science
ISBN:9780534380588
Author:Wayne L. Winston
Publisher:Brooks Cole