BOMBER

PROBLEM
USING SOLVER
 Reduced cost

• The reduction of the coefficient of objective fn

variable necessary for the variable to be positive
in the optimal solution.

• Alternatively, it is the change in the objective

value per unit increase of variable.

• The reduced cost for a decision variable with a

positive value is 0.
 Shadow Price

• Assuming there are no other changes to the

input parameters, the change to the
objective function value per unit increase to
a right hand side of a constraint is called the
“Shadow Price”.
•The dual price for a non-binding constraint is 0.
SPECIAL CASES
INFEASIBLE SOLN

X + Y <= 3
A

Y 6X + 5Y >= 30

B X
SOLVER – INFEASIBLE
MODEL
SPECIAL CASES
Y UNBOUNDED SOLN

X <= 22

X - Y <= 10

X
SOLVER – UNBOUNDED
SOLUTION
 SOLVER – AN ALTERNATE
OPTIMAL SOLUTION
• Solver does not alert the user to the existence
of alternate optimal solutions.
• Many times alternate optimal solutions exist
when the allowable increase or allowable
decrease in coeff of variables is equal to zero.
• In these cases, we can find alternate optimal
solutions using solver by the following
procedure.
 SOLVER – AN ALTERNATE
OPTIMAL SOLUTION
• Observe that for some variable x the
allowable increase = 0, or
allowable decrease = 0.

• Add a constraint of the form:

objective function = current optimal value.

• If allowable increase = 0, change the objective

to maximize x

• If allowable decrease = 0, change the objective

to minimize x
 ALT OPTIMA
Y

8X + 4Y <= 32
A

B
6X + 5Y <= 30

FEASIBLE
REGION
STOCKING
PROBLEM
 STOCKING PROBLEM
•Reqmt to move 60 Tons Stores, 15 Tons Fuel & 320 men into a disaster
prone area.
•Vehs available for induction are 30 x Canters, 10 x Tata Trucks & 07x
Volvo Trucks.
• Carrying capacity of vehicles are :-
Canter – 2 Tons load or 12 men.
Tata Trucks – 5 Tons load or 25 men.
Volvo Trucks – 7 Tons load or 30 troops.
• Carry at least 245 men, 50T stores & 5T fuel in first trip.
• Move of one person is 2.5 times as important as 100 kgs of load.
• Parking space for vehicles at Camp R can accommodate either 20 x
Volvo Trucks or 25 x Tata Trucks or 40 x Canters at one time.
•Work out an optimal move plan for the induction?
 STOCKING PROBLEM
• Objective.
 Maximise utility of load del in 1st trip.
• Decision Variables.
 CL : No of Canters carrying load.
 CP: No of Canters carrying personnel.
 TL : No of Tata Truckscarrying load.
 TP : No of Tata Trucks carrying personnel.
 VL : No of Volvo Trucks carrying load.
 VP : No of Volvo Trucks carrying personnel.
 STOCKING PROBLEM
TATA VOLVO
CANTER

CP CL TP TL VP VL

PERSONNEL LOADS
 STOCKING PROBLEM CL,CP,TL,TP,VL,VP
• Constraints.
– Requirements.
 Min loads to be carried in first trip.

 Min No of tps to be carried in first trip.

 Max loads to be carried.

 Max No of tps to be carried.

– Resources.
 No of Canters available.

 No of Tata Trucks available.

 No of Volvo Trucks available.

 Parking Space available. ..

 STOCKING PROBLEM
CL CP TL TP VL VP AVBL
EFF 8 12 20 25 28 30 MAX
MIN LOAD 2 0 5 0 7 0 55
MIN TPS 0 12 0 25 0 30 245
MAX LOAD 2 0 5 0 7 0 75
MAX TPS 0 12 0 25 0 30 320
AVBL C 1 1 0 0 0 0 30
AVBL T 0 0 1 1 0 0 10
AVBL V 0 0 0 0 1 1 07
PARKING .025 .025 .04 .04 .05 .05 1
 STOCKING PROBLEM
Objective Function.
Z max = 20CL + 30CP + 50TL + 62.5TP + 70VL + 75VP
Subject to.
Min Loads : 2CL + 5TL + 7VL >= 55
Min Tps : 12CP + 25AP + 30LP >= 245
Max Loads: 2CL + 5TL + 7VL <= 75
Max Tps : 12CP + 25TP + 30VP <= 320
Availability:
2.5 Ton : CL+CP <= 30
ALS : TL+TP <= 10
LPT : VL+VP <= 07
Pkg Space: 0.025(CL+CP) + 0.04(TL+TP) + 0.05(VL+VP)<=
1
Non Negativity : CL,CP,TL,TP,VL,VP >= 0
EXCEL SOLVER
SOLN
CL = 00
CP = 10
TL = 02
TP = 08
VL = 07
VP = 00
Zmax = 1390
 Reduced cost (Excel)

• The reduction of the coefficient of objective fn

variable necessary for the variable to be positive
in the optimal solution.

• Alternatively, it is the change in the objective

value per unit increase of variable.
 Shadow Price(Excel)

• Assuming there are no other changes to the

input parameters, the change to the
objective function value per unit increase to
a right hand side of a constraint is called the
“Shadow Price”.
•The dual price for a non-binding constraint is 0.
PESTICIDE
PROBLEM
 PESTICIDE SELECTION
1. There is a requirement to convey pesticide loads to a
supply godown. Three types of containers are available for
transportation as follows:-
Ctn Tons Vol (Cu M)
A 20 35
B 32 50
C 19 30

2. The following three types of pesticide (in packings) can

be taken in any mix:-
Type Wt (Kgs) Volume (Cu M) Eff Per Ton
X 70 0.2 10
Y 65 0.15 12
Z 40 0.075 08
 PESTICIDE SELECTION
• Aim. To maximise the effectiveness of pesticide to be
carried.

• Decision Variables.
TYPE X TYPE Y TYPE Z

Bx By Bz

Ax Ay Az
Cx Cy Cz

A B C