Linear Programming: The Production Problem

A company makes two products P and Q. Raw materials needed for both products are A
and B. Maximum availability of A and B are 6 tons/d and 8 tons/d respectively. Raw
material requirement for producing P and Q are as follows,
Tons of raw material / each ton of product
P Q
A 1 2
B 2 1
Demand of Q cannot exceed the demand for P by more than 1 ton/d. Maximum demand
for Q cannot be more than 2 ton/d. Price of P and Q are Rs 3000/ton and Rs. 2000/ton
respectively. Determine the production strategy for maximizing the turnover.

Solution: X1 and X2 tons/d of P and Q are produced respectively

Maximize: 3000.(X1) + 2000.(X2)

Constraints: X1 + 2(X2) 6 2(X2) + X1 8

X2 X1 1 X2 2

X1, X2 0
s
s
s
>
s
Linear Programming: The Stick-Cutting Problem
20 m long sticks are available. Three orders are received as follows, 5 m sticks: 150; 7 m
sticks: 200; 9 m sticks: 300. Order has to be filled by cutting the available 20 m long sticks.
Cutting can be done by six methods as shown below,
Method 1 2 3 4 5 6
5 m 0 2 2 4 1 0
7 m 1 1 0 0 2 0
9 m 1 0 1 0 0 2
Loss (m) 4 3 1 0 1 2
What should be the mode of operation, i.e., how many 20 m sticks to be cut by which
method, such that the order may be filled with minimum wastage.

Solution: X1, .. X6 sticks will be cut by methods 1 to 6 respectively
Y1, Y2 and Y3 are the numbers of 5, 7 and 9 m sticks respectively in
excess of requirements, i.e., wastage

Minimize: Total Wastage = 5Y1 + 7Y2 + 9Y3 + 4X1 + 3X2 + X3 + X5 + 2X6

Constraints: 2X2 + 2X3 + 4X4 + 5X5 Y1 = 150
X1 + X2 + 2X5 - Y2 = 200
X1 + X3 + 2X6 Y3 = 300
X1, X2,..X6 0; Y1, Y2, Y3 0
X1,..X6 and Y1, Y2, Y3 are integers
> >
Linear Programming: Petroleum Refinery Problem
A petroleum refinery can use four different types of crude oil, which are to be processed to
yield four different products (as shown in the figure below). Crude oil of the type 1, 2 and 3
can only be processed through the fuel chain, while crude oil type 4 can be processed either
though the fuel chain and the lube chain. There are limits on product demand and crude
availability (as shown in the figure below).
1
Petrol
Kerosene
Jet Fuel
Lube Oil
Fuel
Chain
Lube
Chain
Maximum Demand
bbl/week
170,000
85,000
85,000
20,000
2
3
4
100,000
100,000
100,000
200,000
Crude Type
Maximum
Availability
bbl/week
1 2 3 4 Product
Value
$ / bbl
Fuel
Process
Lube
Process
Yield
(bbl product / bbl Crude)
Petrol 0.6 0.5 0.3 0.4 0.4 45.00
Kerosene 0.2 0.2 0.3 0.3 0.1 30.00
Jet Fuel 0.1 0.2 0.3 0.2 0.2 15.00
Lube Oil 0.0 0.0 0.0 0.0 0.2 60.00
Losses 0.1 0.1 0.1 0.1 0.1
Crude Oil Cost, $/bbl 15.00 15.00 15.00 25.00 25.00
Operating Cost, $/bbl 5.00 8.50 7.50 3.00 2.50
Given the tabulated profits, costs and yields (see table below), set up a model for
scheduling the refinery for maximum profit. Solve the resulting LPP.
Solution: X1, X2 and X3 are crude of Types 1, 2 and 3 processed.

X4 and X5 are the crude of Type 4 processed through fuel and lube
chains respectively.
1
Petrol
Kerosene
Jet Fuel
Lube Oil
Fuel
Chain
Lube
Chain
Max. Demand
bbl/week
170,000
85,000
85,000
20,000
2
3
4
100,000
100,000
100,000
200,000
Crude Type
1 2 3 4 Product
Value
$ / bbl
Fuel
Process
Lube
Process
Yield
(bbl product / bbl Crude)
Petrol 0.6 0.5 0.3 0.4 0.4 45.00
Kerosene 0.2 0.2 0.3 0.3 0.1 30.00
Jet Fuel 0.1 0.2 0.3 0.2 0.2 15.00
Lube Oil 0.0 0.0 0.0 0.0 0.2 60.00
Losses 0.1 0.1 0.1 0.1 0.1
Crude Oil Cost, $/bbl 15.00 15.00 15.00 25.00 25.00
Operating Cost, $/bbl 5.00 8.50 7.50 3.00 2.50
Cost of Crude (C)
= 15.(X1+X2+X3) +25.(X4+X5)
Cost of Processing (O) =
=5(X1)+8.5(X2)+7.5(X3) +3(X4)+2.5(X5)
Petrol Price (P) =
=45.[0.6X1+0.5X2+0.3X3+0.4X4+0.4X5]
Kerosene Price (K) =
=30.[0.2X1+0.2X2+0.3X3+0.3X4+0.1X5]
Jet Fuel Price (J) =
=15.[0.1X1+0.2X2+0.3X3+0.2X4+0.2X5]
Lube Price (L) = 60.[0.2X5]

Maximize:
Total Profit = P + K + J + L C O

Constraints:

0.6X1+0.5X2+0.3X3+0.4X4+0.4X5 170000

0.2X1+0.2X2+0.3X3+0.3X4+0.1X5 85000

0.1X1+0.2X2+0.3X3+0.2X4+0.2X5 85000

0.2X5 20000

X1 100000; X2 100000

X3 100000; X4 + X5 200000

X1, ..X5 0
s
s
s
s
s s
s s
>
Linear Programming: Bus Routing Problem

Suppose in a bus route, the minimum number of public buses required at the i
th
hour of the
day is b
i
, i = 1, 24. Each bus runs for 6 consecutive hours. If the number of buses in period
i exceeds the minimum required b
i
, and excess cost of c
i
per bus-hour is incurred.
Formulate the problem as a LPP model so as to minimize the total excess cost incurred,
while ensuring that the minimum required number of buses are available at all times of the
day.

Solution:
There are 24-hourly time intervals in a day. Let the number of buses added to the fleet
during the i
th
time interval be x
i
. These are the decision variables.

Once added to the fleet the bus remains in service for 6-time intervals. Let total number of
busses operating in a time interval be D
i
.

for i = 1, 19, for i = 20


for i = 21 for i = 22


for i = 23 for i = 24

=
+
=
+
5 i
i i
5 i i
D x

= +
+
=
4 i
i i
1 1 i
D x x

+
+
= =
3 i
i i
2
2
1 j
j i
D x x

=

+
+
= =
2 i
i i
3
3
1 j
j i
D x x

+
+
= =
1 i
i i
4
4
1 j
j i
D x x

= +
=
5
1 j
5 j i
D x x
The required number of buses in i
th
time interval is d
i
.

Actual number of buses operating in the ith time interval is D
i


Any bus operating in excess of d
i
has a cost c
i
associated with it.

Objective Function:

Minimize


Constraints:

for i = 1, 24


for i = 1, 24


All x
i
are integers

(

=
i
24
1 i
i i
c . ) d D (
i i
d D >
0 x
i
>
Linear Programming: Bus Routing Problem
Di values (starting from 0 -1 am slot):
6, 5, 3, 2, 3, 6, 8, 15, 18, 24, 24, 22, 18, 16, 15,
14, 18, 24, 24, 22, 18, 16, 12, 8