-Dr.

Parth Modi
SKSBM, Patan
 A firm is engaged in producing two products, A
and B. Each unit of product A requires 2 kg of
raw material and 4 labour hour for processing,
whereas each unit of product B requires 3 kg of
raw material and 3 labour hour, of the same type.
Every week, the firm has an availability of 60 kg
of raw material and 96 labour hours. One unit of
product A sold yields Rs.40 and one unit of
product B sold gives Rs.35 as profit. Formulate
this problem as a linear programming problem to
determine as to how many units of each of the
product should be produced per week so that the
firm can earn maximum profit.
 The agriculture research institute suggested to a
farmer to spread out at least 4800 kg of a special
phosphate fertilizer and not less than 7200 kg of a
special nitrogen fertilizer to raise productivity of
crops in his fields. There are two sources for
obtaining these-mixture A and B. both of these are
available in bags weighting 100 kg each and they
cost Rs.40 and Rs.24 respectively. Mixture A
contains phosphate and nitrogen equivalent of 20
kg and 80 kg respectively, while B contains these
ingredients equivalent of 50 kg each. Write this as a
linear programming problem and determine how
many bags of each type the farmer should buy in
order to obtain the required fertilizer at minimum
cost.
 A company manufactures 3 types of parts which use
precious metals platinum and gold. Due to shortage of
these precious metals, the government regulates the
amount that may be used per day. The relevant data
with respect to supply, requirement, and profits are
summarized in the table as follows:
Product Platinum Gold required/unit Profit/unit (Rs.)
required/unit (gms) (gms)
A 2 3 500
B 4 2 600
C 6 4 1200

Daily allotment of Platinum and gold are 160 gms and

120 gms respectively. How should the company divide
the supply of scare precious metals? Formulate it as a
LPP.
 The marketing department of Everest company has collected information on
the problem of advertising for its products. This relates to the advertising
media available, the number of families expected to be reached with each
alternatives, cost per advertisement, the maximum availability of each
medium and the cost expected to exposure of each one. The information is
as given here:
Advertising media No. of families Cost Maximum Expected
expected to cover per ad availability (No. exposures
(Rs.) of times) (Unit)
TV (30 sec) 3,000 8,000 8 80
Radio (15 sec) 7,000 3,000 30 20
Sunday edition of a 5,000 4,000 4 50
daily (1/4 page)
Magazine (1 page) 2,000 3,000 2 60

 Other information and requirements:

a. The advertising budget is Rs. 70,000
b. At least 40,000 families should be covered.
c. At least 2 insertions be given in Sunday edition of a daily, and not more
than 4 ads should be given on the TV.
d. Draft this as a LPP. The company’s objective is to maximize the expected
exposure.
Maximize
Z = X1 + 3X2
Subject to
X1 + 2X2 ≤ 9
X1 + 4X2 ≤ 11
X1 - X2 ≥ 2
X1, X2 ≥0
Obtain graphically the solution to the following
LPP.
A firm makes two product X and Y, and has a total
production capacity of 9 hours per day., X and Y
requiring the same production capacity. The firm
has a permanent contract to supply at least 2
tonnes of X and at least 3 tonnes of Y per day to
another company. Each tonne of X requires 20
machine hours production time and each tonnes
of Y requires 50 machine hours production time.
The daily maximum possible number of machine
hour is 360. All the firm’s output can be sold, and
the profit made is Rs. 80 per tonne of X and 120
per tonne of Y. It is required to determine the
production schedule for maximum profit and to
calculate this profit by using graphical method.
Minimize
Z = 4X1 + 3X2
Subject to
X1 + 3X2 ≥ 9
2X1 + 3X2 ≥ 12
X1 + X2 ≥ 5
X1, X2 ≥0
Solve graphically the LPP.
Maximize
Z = 0.07X1 + 0.10X2
Subject to
X1 + 2X2 ≤ 30,000
X1 ≥ 6,000
X2 ≤ 12,000
X1 - X2 ≥ 0
X1, X2 ≥0
Obtain graphically the solution to the following
LPP.
Minimize
Z = 12X1 + 3X2
Subject to
4X1 + 6X2 ≥ 24,000
X1 + X2 ≥ 5,000
8X1 + 2X2 ≥ 16,000
X1, X2 ≥0
Solve graphically the LPP.
 A manufacturer has two machines A and B. He
manufactures two products P and Q on these
machines. For manufacturing product P he has
to use machine A for three hours and machine
B for six hours, and for manufacturing product
Q he has to use machine A for six hours and
machine B for five hours. On each unit of P he
earns Rs. 4 and on each unit of Q he earns Rs.
5. How many units of P and Q should be
manufactured to get maximum profit? Each
machine cannot be used for more than 2100
hours. Solve the LPP by Graphical method.
 The ABC Company has been a producer of picture
tubes for television sets and certain printed
circuits for radios. The company has just
expanded in to full scale production and
marketing of AM and AM-FM radios. It has built a
new plant that can operate 48 hours per week.
production of an AM radio in the new plant will
require 2 hours and production of an AM-FM
radio will require 3 hours. each AM radio will
contribute Rs. 40 to profits while an AM-FM radio
will contribute Rs. 80 to profits. The marketing
department ,after extensive research has
determined that a maximum of 15 AM radios and
10 AM-FM radios can be sold each week.
 Formulate a linear programming model to
determine the optimum production mix of AM and
FM radios
 A company produces two types of leather belts,
say A and B. Belt A is of superior quality and B is
inferior. Profit on the two is 40 and 30 rupees per
belt respectively. Each belt of type A requires
twice as much time as required by a belt of type B.
If all the belts were of type B, the company could
produce 1,000 belts per day. Belt A requires a
Fancy buckle and only 400 of them are available
per day. For belt B only 700 Buckles are available
per day. The supply of leather is sufficient only for
800 belts per day. How should the company
manufacture the two types of belts in order to
have a maximum overall profit? Solve it using
Graphical Method.
Solve the following LP problem using graphical
method.
Min
Z = 20 X1 + 10 X2
Subject to
X1 + 2X2 ≤ 40,
X1 + X2 ≥ 30,
4X1 + 3X2 ≥ 60,
X1, X2 ≥ 0
A manufacturer produces two different models, X
and Y of the same product. The raw materials R1
and R2 are required for production. At least 18 kg
of R1 and 12 kg of R2 are must be used daily.
Also at most 34 hours of labour are to be utilized.
2 kg of R1 are needed for each model X and 1 kg
of R1 for each model Y. For each model of X and
Y, 1 kg of R2 is required. It takes 3 hours to
manufacture a model X and 2 hours to
manufacture a model Y. The profit is Rs.50 for
each model X and Rs. 30 for each model Y. How
many units of each model should be produced to
maximize the profit? Formulate this problem as
an LP model and solve it graphically.
Solve the following LP problem using graphical
method.
Min
Z = 2X1 + X2
Subject to
10X1 + 10X2 ≥ 300,
40X1 + 30X2 ≤ 600,
X1, X2 ≥ 0
 A manufacturing co. is engaged in producing three type of the
product ; A, B,and C. the production department produces each
day, component sufficient to make 50 units of A, 25 units of B
and 30 units of C. the mgmt is confronted with the problem of
optimizing the daily production of products is assembly
department where only 100 man-hours are available daily to
assemble the products.
Type of product Profit Assembly time
per product (hrs)
A 12 0.8
B 20 1.7
C 45 2.5
The company has a daily order commitment for 20 units of
product A and a total of 15 units of products B and C. formulate
this problem as an LP Model so as to maximize the total profit.
An Electronics Company is engaged in the production of two
components c1 and c2, used in radio sets. Each unit of c1
costs Rs 5 in wages and Rs 5 in materials, while c2 costs Rs
25 wages and Rs 15 material. The selling price of c1 is Rs 30
and C2 Rs 70 per units. The production capacity is limited by
two considerations. First at the beginning of period 1, the
company has initial balance of Rs 4000. Second, the company
has available in each period 2000 hours of machine time and
1400 hours of assembly time. The production of c1 requires
3 hours of machine and 2 hours of assembly time, whereas c2
requires 2 hour of machine time and 3 hours of assembly
time. Formulate this problem as an LP model so as to
maximize the total profit to the company. The company can
sell both products on one month credit period and wages and
labour and material expenses must be paid in cash.