Problems on Formulation of Linear Programming Model

(1) A firm manufactures 2 types of products A and B, and sells them

at a profit of Rs. 2/- on A and Rs.3/- on B. Each product is
processed on two machines G and H. One unit of the type A
requires 1 minute of processing time on G and 2 minutes on H.
One unit of the type B requires one minute of processing time on
each of G and H. The machine G is available for not more than 6
hours and 40 minutes, while H is available for not more than 10 hours
during any day. Formulate the problem as L. P. P.
Machines Products Time (Hrs)
A B
G 1 1 400
H 2 1 600
Unit Profit Rs.2/- Rs.3/-

Solution : Let x1 and x2 be the number of units of the type A and type
B
Produced.
Then, the given problem may be formulated in the L.P. model as :
Maximize Z = 2x1 + 3x2,
Subject to the Constraints : x1 + x2 ¿ 400
2x1 + x2 ¿ 600 ,
and x1 , x2 ¿ o
(2) A company produces two types of hats. Each hat of the 1 st type
requires twice as much labor time as that of the 2 nd type. If all the
hats to be made are of the 2 nd type only, the company can
produce total 500 hats per day. The market limits the daily sales of
the two types of hats to 150 for A and 250 for B. The unit profits
 are Rs.8/- for A and Rs. 5/- for B. Formulate this as L. P. P. to
maximize the total profit.
Solution :
Let y = Time taken for one hat of the 2nd type.
Then → the L.P. Formulation of the problem will be :
Maximize Z = 8x1 + 5x2 ,
Subject to the Constraints : (x1.2y) + x2.y ¿ 500 y or 2x1 + x2 ¿
500
x1 ¿
150
x2 ¿
250,
and x1 , x 2 ¿
0
(3) A machine manufactures 3 products A, B, and C. The unit profits are
Rs. 3, 2, and 4 respectively. The firm has 2 machines. The required
processing times are given below:
Product A B C Machining Time
s Available (Hours)
M/c’s
Machine P 4 3 5 2000 minutes
Machine Q 2 2 4 2500 minutes

The firm must manufacture at least 100 A’s, 200 B’ s, and 50 C’s,
but no more than 150 A’s. Formulate this as L. P. P.
Solution :
Maximize Z = 3x1 + 2x2 + 4 x3,
Subject to the Constraints :
4x1 + 3x2 + 5x3 ¿ 2000
 2x1 + 2x2 + 4x3 ¿ 2500
100 ¿ x1 ¿ 150,
x2 ¿ 200, x3 ¿ 50,
and x1, x2 ¿ 0.

(4) Consider a shop with 3 types of machines A, B, and C which turn out
4
products 1, 2, 3, and 4. Each of these products has to undergo some
operation on each of the 3 types of machines A, B, and C. Assume that
the production is continuous, and that each product must first go on
the
machine of type A, then on B, and finally on C. Further, assume that
the
time required for adjusting the set-up of each machine to a different
operation, when the production shifts from one product to another, is
negligible. The data regarding the hours required on each machine type per
unit of each product, the total available machine hours per week, and
the
unit profit for each product are furnished in the table below. Assume
that
the profit is directly proportional to the number of units sold.
Determine
the weekly output for each product in order to maximize the total profit.

Machine Processing Time of the Products Total time

Type (in Hours) Available per
1 2 3 4 week (Hours.)
A 1.5 1 2.4 1 2000
B 1 5 1 305
8000
 C 1.5 3 3.5 1.0
5000
UNIT 5.24 7.30 8.34 4.18
PROFIT(Rs.)

Solution :
Suppose xj is the number of units of product j produced per week.
Find the value of xj, j = 1,2,3 in order to
Maximize the Total weekly Profit Z = 5.24 x1 + 7.30 x2 + 8.34 x3 +4.18
x4
Subject to the Restrictions / Constraints :
1.5 x1 + x2 + 2.4 x3 + x4 ¿ 2000
x1 + 5 x2 + x3 + 3.5 x4 ¿ 8000
1.5 x1 + 3 x2 + 3.5 x3 + x4 ¿ 5000
and x1 ¿ 0, x2 ¿ 0, x3 ¿ 0, x4 ¿ 0 ( Non – Negativity Restrictions).