CHAPTER 2

EXAMPLE 2.6·1 (ProductionAllocation Problem)

A firm produces three products. These products are processed on three different
machines. The time required to manufacture one unit of each of the three products and the
daily capacity of the three machines are given in the table below.

It is required to determine the daily number of units to be manufactured for each product.
The profit per unit for product 1, 2 and 3 is Rs 4, Rs 3 and Rs 6 respectively. It is assumed that all the
amounts produced are consumed in the market. Formulate the mathematical (L.P.) model that will
maximize the daily profit. [G.N.D.U. BBA Sept., 1998; H.P.U. MCA, 1999]
Formulation of Linear Programming
Model
STEP 1 Decision Variables
Let x1 = Daily manufactured for Product-
x2 1= ….. ‫… ׀׀‬.. Product-
2
x3 = Daily manufactured for Product-3
STEP 2 Objective Function
To maximize the  Z = 4 x1 + 3 x2 + 6
profit : ? x3
STEP 3 Constraints
2 x1 + 3 x2 + 2 x3 ≤ 440 (Machine M1)
4 x1 + 0 x2 + 3 x3 ≤ 470 (Machine
M2)
2 x1 + 5 x2 + 0 x3 ≤ 430 (Machine M3)
STEP 4 Non-negativity
x1 , x2 , x3 ≥ 0
EXAMPLE2.6·2 (Diet Problem)

A person wants to decide the constituents of a diet which will fulfil his daily requirements of
proteins, fats and carbohydrates at the minimum cost. The choice is to be made from four
different types of foods. The yields per unit of these foods are given in table 2.2.
TTABLE 2.2

Formulate linear programming model for the problem.

EXAMPLE STEP 1 Decision Variables
(2.6.2)
Let x1 = Number of units of Food Type 1
x2 = ….. ‫… ׀׀‬.. Food Type 2
x3 = ….. ‫… ׀׀‬.. Food Type 3
x4 = Number of units of Food Type 4
STEP 2 Objective Function
To minimize the Cost : ? Z = 45 x1 + 40 x2 + 85 x3+ 65 x4 (Rs)
STEP 3 Constraints
3 x1 + 4 x2 + 8 x3 + 6 x4 ≥ 800 (Protein)
2 x1 + 2 x2 + 7 x3 + 5 x4 ≥ 200 (Fats)
6 x1 + 4 x2 + 7 x3 + 4 x4 ≥ 700
(Carbohydrates)
STEP 4 Non-negativity
x1 , x2 , x3 , x4 ≥ 0
EXAMPLE 2.6·3 (Blending Problem)

A firm produces an alloy having the following specifications:

(i) specific gravity ≤ 0.98,
(ii) Chromium ≥ 8%,
(iii) melting point ≥ 450°C.
Raw materials A, Band C having the properties shown in the table can be used
to make the alloy. TABLE 2.3

Costs of the various raw materials per ton are: Rs 90 for A, Rs 280 for B and Rs
40 for C. Formulate the L.P. model to find the proportions in which A, Band C be
used to obtain an alloy of desired properties while the cost of raw materials is
minimum.
[G.N.D.U. BEA April, 2006; P. U.B.E. (E. and Ee.) 1998]
Formulation of Linear Programming
Model
STEP 1 Decision Variables
Let x1 = Percentage contents of raw Material A
x2 = ….. ‫… ׀׀‬.. raw Material
B
x3 = Percentage contents of raw Material C
STEP 2 Objective Function
To minimize the cost : ? Z = 90 x1 + 280 x2 + 40 x3 (Rs)
STEP 3 Constraints
0.92 x1 + 0.97 x2 + 1.04 x3 ≤ 0.98 (Specific
gravity)
7 x1 + 13 x2 + 16 x3 ≥ 8 (Chronium)
440 x1 + 490 x2 + 480 x3 ≥ 450 (Melting Point)
STEP 4 Non-negativity
x1 , x2 , x3 ≥ 0
EXAMPLE (2.6.4) Advertising Media Selection
Problem
An advertising company wishes to plan its advertising strategy in three different
media television, radio and magazines. The purpose of advertising is to reach as large
a number of potential customers as possible. Following data have been obtained from
market survey.
TABLE 2.4

Particular Television (Rs) Radio (Rs) Magazine-I Magazine-II

Cost of an advertising unit 30,000 20,000 15,000 10,000
No. of Potential customers
reached per unit 200,000 600,000 150,000 100,000

No. of Female customers

reached per unit 150,000 400,000 70,000 50,000
The company wants to spend not more than Rs 4,50,000 on advertising. Following are
the further requirements that must be met:
(i) at least 1 million exposures take place among female customers
(ii) advertising on magazines be limited to Rs 1,50,000,
(iii) at least 3 advertising units be bought on magazine I and 2 units on magazine II,
(iv) the number of advertising units on television and radio each be between 5 and 10.
Formulate an L.P. model for the problem.

[H.P. U.B. Tech. (Mech.) June, 2010; P.T. U. MBA May, 2002]
EG. (2.6.4) SOLUTION :
x3 ≥ 3 (no. of units on magazine)
STEP 1 Decision Variables
x4 ≥ 2 …….. ‫…… ׀׀‬
Let x1 = advertising units bought on TV
5 ≤ x1 ≤ 10 or x1 ≥ 5, x1 ≤ 10 (tele-
x2 = …….. ‫…… ׀׀‬ v)
Radio 5 ≤ x2 ≤ 10 or x2 ≥ 5, x2 ≤ 10
(radio)
x3 = …….. ‫ …… ׀׀‬Magazine-1 STEP 4 Non-negativity
x1 , x2 , x3 , x4 ≥ 0
STEP 2x Objective
= Function
…….. ‫ …… ׀׀‬Magazine-2
4
To maximize Potential
customers: ?
Z = 105 ( 2 x1 + 6 x2 + 1.5 x3 + x4
) 3 Constraints
STEP
30 x1 + 20 x2 + 15 x3 + 10 x4 ≤ 450
15(adv)
x1 + 40 x2 + 7 x3 + 5 x4 ≥ 100 (adv-fem)
15 x3 + 10 x4 ≤ 150 (expense on
EXAMPLE 2.6·5 (Inspection Problem)

A company has two grades of inspectors, I and II to undertake quality control inspection. At
least 1,500 pieces must be inspected in an 8-hour day. Grade I inspector can check 20 pieces in
an hour with an accuracy of 96%. Grade II inspector checks 14 pieces an hour with an accuracy
of 92%.
Wages of grade I inspector are Rs 5 per hour while those of grade II inspector are Rs 4 per
hour. Any error made by an inspector costs Rs 3 to the company. If there are, in all, 10 grade I
inspectors and 15 grade II inspectors in the company, find the optimal assignment of inspectors
that minimizes the daily inspection cost. [P. U. B.Com. April, 2008; D. U. MBA, 2003, 02, 00;
NIIFT Mohali, 2000]
STEP 1 Decision Variables
Let x1 = no, of grade I inspectors
x2 = no. of grade II inspectors
STEP 2 Objective Function

To minimize the daily cost of inspection ?

To cost can be divided to (i) wages paid to inspector
(ii) cost made by their inspector
For Grade I inspector/hr is Rs ( 5 + 3 x 0.04 x 20) = Rs 7.40
For Grade II inspector/hr is Rs ( 4 + 3 x 0.08 x 14) = Rs 7.36
⸫ Z = 8 (7.40 x1 + 7.36 x2 ) = 59.20 x1 + 58.88
x2
STEP 3 Constraints
x1 ≤ 10 (Grade I)
x2 ≤ 15 (Grade II)
 To number of pieces to be inspected daily

20 x 8 x1 + 14 x 8 x2 ≥ 1500
160 x1 + 112 x2 ≥ 1500
STEP 4 Non-negativity

x1 , x2 ≥ 0
EXAMPLE (2.6.6) Product Mix
Problem
A chemical company produces two products, X and Y. Each unit of product X
requires 3 hours on Operation I and 4 hours on operation II, while each unit of
product Y requires 4 hours on operation I and 5 hours on operation II. Total available
time for Operations I and II is 20 hours and 26 hours respectively. The production of
each unit of product Y also results in two units of a by-product Z at no extra cost.

Product X sells at profit of Rs 10/unit, while Y sells at profit of Rs 20/unit. By-product

Z brings a unit profit of Rs 6 if sold; in case it cannot be sold, the destruction cost is
Rs 4/unit. Forecasts indicate that not more than 5 units of Z can be sold. Formulate the
L.P. model to determine the quantities of X and Y to be produced, keeping Z in mind,
so that the profit earned is maximum.

[P. U.B. Com. April, 2006; Jammu U.B.E. (Mech.) 2004; P.T. U.B.Tech. 2000; R.E.C. Hamirpun 1998]
EG. (2.6.6) SOLUTION STEP 3 Constraints
STEP 1 Decision Variables Operation I : ? 3 x1 + 4 x2 ≤ 20
Let x1 = no. of units of Product X Operation II : ? 4 x1 + 5 x2 ≤ 20
x2 = ….. ‫… ׀׀‬.. Product No. of units of product Z sold: ? x3 ≤ 5
Y
No. of units of product Z produced: 2y = Z
xz = no. of units of Product Z
xz = no. of units of Z sold + (OR) 2 x2 = x3 + x4
no. of units of Z (OR) ̶ 2 x2 + x3 + x4 = 0
destroyed
= x3 + x4
STEP 2 Objective Function STEP 4 Non-negativity
x1 , x2 , x3 , x4 ≥ 0
To maximize the profit : ?

Z = 10 x1 + 20 x2 + 6 x3 ̶ 4 x4
EG. (2.6.9)

TABLE 2.6

Input per run (units) Out per run

(units)
Raw material 1 Raw material 2 Part A Part B

1 7 5 6 4
2 4 7 5 8
3 2 9 7 3
Formulate the L.P model to determine the number of production runs for each method
so as to maximize the total number of complete units of the final product.
[H.P U. B.Tech. (Mech.) June, 2008]
EG. (2.6.9) SOLUTION Each unit of final product requires 5 units of
STEP 1 Decision Variables Part-A and 4 units of Part-B.

Let x1 = no. of product run for Method-1 It is evident that the maximum no. of units
x2 = …….. ‫…… ׀׀‬ Method- of the Final product cannot exceed the
2 smaller value of
x3 = no. of product run for Method-3
STEP 2 Objective Function and

To maximize the total no. of units of the final ⸫ the objective is to

product.
maximize :
To maximize the total no. of units Part-A ,
produced by different method is : Z = Min of
6 x1 + 5 x2 + 7 x3 and
for Part-B is 4 x1 + 8 x2 + 3 x3
STEP 2 Objective Function
STEP 3 Constraints
Thus, the mathematical model
Raw Material-1 = ? 7 x1 + 4 x2 + 2 x3 ≤ for the problem is :
Raw Material-2 = ? 120
5 x1 + 7 x2 + 9 x3 ≤ Maximize Z = y
240
, Subject to the constraints is :
Let y = Min of 7 x1 + 4 x2 + 2 x3 ≤ 120
5 x1 + 7 x2 + 9 x3 ≤ 240
6 x1 + 5 x2 + 7 x3- 5 y ≥ 0
i.e ≥ y 4 x1 + 8 x2 + 3 x3- 4 y ≥ 0
and
STEP 4 Non-negativity
≥
y x1 , x2 , x3 , y ≥ 0
6 x1 + 5 x2 + 7 x3- 5 y ≥ 0
4 x1 + 8 x2 + 3 x3- 4 y ≥ 0
EXAMPLE 2.6-10 (Fluid Blending Problem)

An oil company produces two grades of gasoline P and Q which it sells at Rs 30 and Rs 40
per litre. The company can buy four different crude oils with the following constituents and
costs:
Table 2.7
 EG. (2.6.10) SOLUTION

STEP-1 DECISION VARIABLES

How much of each crude oil be used in making each of the two grades of gasoline.
Let Quantities in litres be = xij i = Crude oil, i = 1, 2, 3, 4 j = Gasoline of grades P and Q
Let x1p = amount in litres of crude Oil-1 used in Gasoline-P
x2p = …….. ‫ …… ׀׀‬crude Oil-2 …….. ‫…… ׀׀‬
x3p = …….. ‫…… ׀׀‬ crude Oil-3 …….. ‫…… ׀׀‬
x4p = amount in litres of crude Oil-4 used in Gasoline-P
And x1q = amount in litres of crude Oil-1 used in Gasoline-Q
x2q = …….. ‫ …… ׀׀‬crude Oil-2 …….. ‫…… ׀׀‬
x3q = …….. ‫…… ׀׀‬ crude Oil-3 …….. ‫…… ׀׀‬
x4q = amount in litres of crude Oil-4 used in Gasoline-Q
STEP 2 OBJECTIVE FUNCTION
To maximize the net profit: ?

30 (x1P + x2P + x3P + x4P) + 40 (x1q + x2q + x3q + x4q) - 20 (x1p +

Max Z = x )
1q

- 22.5 (x2q + x2q) - 25 (x3p + x3q) – 27.5 (x4p + x4q)

Max Z = 10 x1P + 7.5 x2P + 5 x3P + 2.5 x4P + 20 x1q + 17.5 x2q + 15 x3q + 12.5
x4q
STEP 3 CONSTRAINTS
0.75 x1P + 0.2 x2P + 0.7 x3P + 0.4 x4P ≥ 0.55 (x1p + x2p + x3p +
x0.10
4p) x
1P + 0.5 x2P + 0.2 x3P + 0.5 x4P ≤ 0.40 (x1p + x2p + x3p +
x0.10
4p) x ≤ 0.25 (x1q + x2q + x3q +
1q + 0.5 x2q + 0.2 x3q + 0.5 x4q
x4q)
STEP 4 NON-NEGAVITITY
x1P , x2P , x3P , x4P , x1q , x2q , x3q , x4q ≥ 0