(Quantitative Analysis) Linear Programming

(Quantitative Analysis) Linear Programming
1. A farmer can obtain two types of fertilizers. A bag of fertilizer M costs Rs.
50 and contains 6 kg of nitrogen and 3 kg of potassium. A bag of fertilizer
N costs Rs.40 and contains 3 kg of nitrogen and 3 kg of potassium. If the
farmer wants to add at least 30 kg of nitrogen and at least 18 kg of
potassium to each plot of land, formulate the problem of minimizing the
cost of fertilizing a plot of land? Also, solve the L.P. problem
graphically.[Ans: 280 at (4, 2)]
2. One kind of cake takes 200 gm of flour and 25 gm of fat and another kind
of cake takes 100 gm of flour and 50 gm of fat. Suppose we want to make
as many cakes as possible but have only 4 kg of flour and 1.175 kg of fat
available, although there is no shortage of the various other ingredients. If
the profit on selling first and second kinds of cakes are Rs. 3 and Rs. 2
respectively, formulate the above L.P. problem and find how many of each
kind of cake should we make so that the profit may be maximum. [Ans: 69
at (11, 18)]
3. Maximize z = 5x1 + 3x2 subject to 3x1 + 5x2 15, 5x1 + 2x2 10, x1 0 and x2
0 [Ans: 235/19 at (20/19, 45/19)]
4. A firm makes two types of furniture: Chair and Table. The contributions for
each product as calculated by accounting departments are Rs. 20 per chair
and Rs. 30 per table. Both products are processed on three machines M 1,
M2, M2. The time required by each product and total time available per
unit on each machine is as follows:
i.
Machine
Chair
Table
M1
3
3
M2
5
2
M3
2
6
Formulate this problem as a L.P. problem.
Available Hours
36
50
60
ii.
How should the manufacturer schedule his production in order to

maximize contribution? Use graphical method.
5. A shopkeeper wishes to buy some pens and copies. Pen cost Rs. 18 each
and copies cost Rs. 12 each. The shopkeeper has no place for more than
20 pens and copies and cannot afford to pay more than Rs. 288. If he can
reasonably expect to make a profit of Rs.11 per pen and Rs. 9 per copy,
how many of each should he buy in order to make his total profit as large
as possible? [Ans: Rs. 196 at (8, 12)]
6. Minimize z = 5x + 3y subject to 2x + y 6, x 2, x 0 and y 0 [Ans: Min z
= 0 at (0, 0)]
7. Suppose that 8, 12 and 9 units of protein, carbohydrate and fat
respectively are the minimum weekly requirements for a person. Food A
contains 2, 6 and 1 units of protein, carbohydrate and fat respectively per
kg. and food B contains 1, 1 and 3 units respectively per kg. If A costs Rs.
0.85 per kg and B costs Rs. 0.40 per kg; how many kgs of each should be
buy per week to minimize his cost and still meet his minimum
requirements. Formulate the above problem as a linear programming
problem. [Ans: Rs. 3.25, A = 1kg and B = 6 kg]
8. A handloom firm produces two types of clothes A and B and makes a profit
of Rs. 20 per unit on A and Rs. 25 per unit of B. Three types of workers
(skilled, semi-skilled and unskilled) are available each for 8 hours a day.
The production of the unit of A requires hour of skilled worker and 2/3
hour of the unskilled worker. Production of one unit of B requires 1/3 hour
of the semi-skilled worker and hour of the unskilled worker. What
combination of the two types of cloth should be produced to maximize
total profit? Solve the problem graphically. [Ans: Rs. 400, A = 0, B = 16]
9. The Destiny Foundation combines factories A and B to form final product
which must weigh exactly 150 kg. Factor A costs Rs. 2 per unit and B costs
Rs. 8 per unit. At least 14 units of B and mo more than 20 units of A must
be used. Each unit of A weighs 5 kgs. and each unit of B weighs 10 kg. How
much each type of raw material should be used for each unit of final
product if the company wishes to minimum cost? [Ans: Rs. 116, A = 2 and
B = 14]
10. A firm uses lathes, milling and grinding machines to produce two machine
parts. The following table represents the machining times required for
each part, the machine times available on different machines and the
profit on each machine part.
Types of
machines
Lathes
Milling
Grinding
Profit per unit
Machining time required for the

Maximum time
machine part(mins)
available(mins)
I
II
12
6
3000
4
10
2000
2
3
900
Rs. 40
Rs. 100
[ Ans: Rs. 20000 at (187.5, 125) and (0, 200)]

(Quantitative Analysis) Linear Programming

Uploaded by

(Quantitative Analysis) Linear Programming

Uploaded by

(Quantitative Analysis) Linear Programming

How should the manufacturer schedule his production in order to

Machining time required for the

You might also like