Q.

1 In a chemical industry two products A and B are made involving two

operations I and II. The production of B results also in a by-product
C. The product A can be sold at a profit of Rs. 3 per unit, B at a
profit of Rs. 8 per unit and the by-product at Rs. 2 per unit. C
can not be sold wholly and forecasts show that upto 5 units of C can
be sold. The company gets 3 units of C for each unit of B produced.
Forecasts show that all the units of A and B produced can be sold.
The manufacturing times are 3 hrs per unit for A on operation I and
II respectively and 4 hrs and 5 hrs per unit of B on operation I and
II respectively. Because the product C results from producing B, no
time is used in producing C. The available times are 18 and 21 hrs of
operations I and II respectively. Formulate the mathematical model so
as to determine the quantities of A and B to be produced keeping C in
mind which would maximize the profit.

Sol. x1 : Quantity of A to be produced

x2 : Quantity of B to be produced

Max 3x1 + 8x2 + k

Subject to 3x1 + 4x2 ≤ 18
3x1 + 5x2 ≤ 21
x 1 , x2 ≥ 0
)
10 if x2 > 1
Where k =
6x2 if x2 ≤ 1

Q. 2 Diet Problem: The medical experts and dieticians tell that it is nec-
essary for and adult to consume at least 75 gm of proteins, 85 gm of
fats and 300 gm of carbohydrates daily. The table below gives the food
items analysis and their respective cost. One is interested in finding
the food mix that should be recommended so that the total cost of food
satisfying minimum requirements of balanced diet is the lowest.

Food Type Food value (Gms.) Per kg. Cost per kg.
Proteins Fats Carbohydrates (Rs.)
1 8.0 1.5 35.0 1.00
2 18.0 15.0 – 3.00
3 16.0 4.0 7.0 4.00
4 4.0 20.0 2.5 2.00
5 5.0 8.0 40.0 1.50
6 2.5 – 25.0 3.00

1
Sol. xj : Quantity of food type j

Min x1 +3x2 +4x3 +2x4 +1.5x5 +3x6

Subject to 8x1 +18x2 +16x3 +4x4 +5x5 +2.5x6 ≥ 75
1.5x1 +15x2 +4x3 +20x4 +8x5 ≥ 85
35x1 +7x3 +2.5x4 +40x5 +25x6 ≥ 300
xj ≥0∀j

Q. 3 An automobile manufacturer makes automobiles and trucks in a factory

that is divided into two shops. Shop A, which performs the basic
assembly operation, must work 5 man-days on each truck but only
2 man-days on each automobile. Shop B, which performs finishing
operations must work for 3 man-days on each automobile or truck that
it produces. Because of man and machine limitations shop A has 180
man-days per week available while shop B, has 135 man-days per week.
The manufacturer makes a profit of Rs. 15,000 on each truck and
Rs. 10,000 on each automobile. Construct the programming model to
determine the rent per man-day that should be charged if Shop A and
B are rented out for some time.

Sol. y1 : Rent charged for shop A per man-day y2 : Rent charged for shop
B per man-day

Min 180w1 + 135w2

Subject to 5x1 + 3x2 ≥ 15000
2x1 + 3x2 ≥ 10000
x 1 , x2 ≥ 0

Q. 4 The owner of a small machine shop has 4 machinists available to assign

to jobs for the day. Five jobs are offered with the expected profit (in
Rs.) for each machinists on each job being given below. Construct the
mathematical model to determine as to which job should be declined.
1 2 3 4 5
1 62 78 50 101 82
Machinists 2 71 84 61 73 59
3 87 92 111 71 81
4 48 64 87 77 80

Sol. xij : Variable associated with ith machinist and j th job.

xij = 1 if ith machinist does the j th job and xij = 0 if ith machinist
does not do the j th job

2
 4 X
X 5
Minimize cij xij
i=1 j=1
5
X
Subject to xij = 1, i = 1, 2, 3, 4
j=1
X4
xij ≤ 1, j = 1, 2, 3, 4, 5
i=1
xij = 0 or 1, ∀ (i, j)

Q. 5 A manufacturer has centers located at Agra, Allahabad and Calcutta.

These centers have available 40, 20 and 40 units of his product. His
retail outlets require the following number of units A: 20, B: 30, C: 15,
and D: 35. The shipping cost per unit in rupees between each centre
and outlet is given below. Construct the model so as to minimize the
total shipping cost.

Distribution Centers Retail Outlets

A B C D
Agra 55 65 45 75
Allahabad 45 53 47 59
Calcutta 62 60 73 67

Sol. xij : Quantity of product shipped from ith center to j th retail outlet.

4 X
X 4
Minimize cij xij
i=1 j=1
4
X
Subject to xij = ai , i = 1, 2, 3, 4
j=1
X4
xij = bj , j = 1, 2, 3, 4
i=1
xij = 0 or 1, ∀ (i, j)

Q. 6 There are 3 wholesales dealers having 8, 12, 14, quintals of rice available
with them. They supply to 4 retailers whose requirements are 7, 9,
8 and 6 quintals. The transportation cost (rupees per quintal) for
shipping rice from wholesalers to retailers are shown in the following
table.

3
 Retailers
1 2 3 4
1 54 53 52 60
Wholesalers 2 61 59 53 57
3 58 62 56 55

Construct models to determine how much rice should be supplied by a

wholesaler to each retailer so as to minimize the overall shipment cost
if.

(a) Wholesaler are to empty their godowns and retailers have to be

oversupplied.
Sol. xij : Quantity of product shipped from ith wholesaler to j th re-
tailer.

3 X
X 4
Minimize cij xij
i=1 j=1
4
X
Subject to xij = ai , i = 1, 2, 3
j=1
X3
xij ≥ bj , j = 1, 2, 3, 4
i=1
xij = 0 or 1, ∀ (i, j)

(b) Retailers are not prepared to receive more than their requirements.
Sol.
3 X
X 4
Minimize cij xij
i=1 j=1
4
X
Subject to xij ≤ ai , i = 1, 2, 3
j=1
X3
xij = bj , j = 1, 2, 3, 4
i=1
xij = 0 or 1, ∀ (i, j)

Q. 7 The Bombay Transport Company has trucks available at 4 different

sites in the following numbers:

Site: A B C D
No. of Trucks: 5 10 7 3

4
 Customers X, Y and Z require trucks as shown:

Customers: X Y Z
No. of Trucks: 10 8 7

Trucks simultaneously start at 7.00 AM in the morning from the various

sites for the customers. Time (his) taken by a truck from its site to a
particular customer is given in the following table:

Customer
X Y Z
A 2 3 1
Site B 1.5 1 0.5
C 1 2 1.5
D 0.5 2 1.2

Construct the model to determine the number of trucks to be dis-

patched from each site to various customers so as to minimize the time
by which the customers receive the requisite number of trucks.
Sol.
Minimize max tij (xij )
3
X
Subject to xij = ai , i = 1, 2, 3, 4
j=1
X4
xij = bj , j = 1, 2, 3
i=1
xij = 0 or 1, ∀ (i, j)

where )
tij (xij ) = tij (≥ 0), if xij > 0
= 0, if xij = 0