LPP Class Test 28 Jan.-2022
LPP Class Test 28 Jan.-2022
MATHEMATICS
(LINEAR PROGRAMMING PROBLEM) CLASS TEST
Date: 28 Jan.-2022
Time: 02:30 Hours Maximum Marks: 200
P.T.O.
2 of 30
1. 10
2. 18
3. 17
4. 10
5. 15
6. 20
7. 17
8. 10
9. 15
10. 15
11. 18
12. 20
13. 15
Total Marks
P.T.O.
3 of 30
1. The standard weight of a special purpose brick is 5 kg and it contains two basic
ingredients B1 and B2. B1 costs Rs. 5 per kg and B2 costs Rs. 8 per kg. Strength
considerations state that the brick contains not more than 4 kg of B1 and minimum
of 2 kg of B2. Since the demand for the product is likely to be related to the price
of the brick, find out graphically minimum cost of the brick satisfying the above
conditions. [10]
P.T.O.
[4-30]
2. The following table gives the cost for transporting material from supply points A,
B, C and D to demand points E, F, G, H, and J.
To
E F G H J
A 8 10 12 17 15
B 15 13 18 11 9
From
C 14 20 6 10 13
D 13 19 7 5 12
3. Using the simplex method solve the LPP problem: Minimize Z = x1 + x2, subject
to 2x1 + x2 ≥ 4, x1 + 7x2 ≥ 7, and x1, x2 ≥ 0. [17]
x1 2=
4. If= , x2 3, x3 = 1 be a feasible solution of the following Linear Programming
problem then find the basic feasible solution:
Maximize Z x1 2 x2 4 x3
3 x1 x2 5 x3 14
and x1 , x2 , x3 ≥ 0. [10]
6. A product is produced by four factories F1, F2, F3, F4. The unit production costs
in them are Rs. 1, Rs. 3,
Rs. 1 and Rs. 5 respectively. Their production capacities are : F1 – 50 units, F2 – 70
units, F3 –30 units, F4 – 50 units. These factories supply the product to four stores
S1, S2, S3 and S4, demands of which are 25, 35, 105 and 20 units respectively.
Unit transport cost in rupees from each factory to each store is given in the table
below. Determine the extent of derivaties from each of the factories to each of the
stores so that the total production and transportation cost is minimum.
S1 S2 S3 S4
F1 2 4 6 11
F2 10 8 7 5
F3 13 3 9 12
F4 4 6 8 3
[20]
7. Find the initial basic feasible solution of the following transportation problem
by Vogel’s approximation method and use it to find the optimal solution and the
transportation cost of the problem. [17]
12.(A) For each hour per day that Ashok studies mathematics, it yields him 10
marks and for each hour that he studies physics, it yields him 5 marks. He
can study at most 14 hours a day and he must get at least 40 marks in each.
Determine graphically how many hours a day he should study mathematics
and physics each, in order to maximize his marks?
(B) Find all the basic feasible solutions of the following problem:
2x1 + 3x2 + x3 + x4 = 8
x1 – 2x2 + 6x3 – 7x4 = –3
and choose the one which
Maximize Z = 2x1 + 3x2 + 4x3 + 7x4 [10+10=20]
ROUGH SPACE