LPP Class Test 22 April 2023
LPP Class Test 22 April 2023
MATHEMATICS
(LINEAR PROGRAMMING PROBLEM) CLASS TEST
Date: 22 April 2023
Maximum Marks: 250
Time: 03:00 Hours
P.T.O.
2 of 26
1. 10
2. 10
3. 15
4. 18
5. 15
6. 13
7. 10
8. 10
9. 10
10. 17
11. 10
12. 15
13. 10
14. 18
15. 20
16. 10
17. 17
18. 12
19. 10
Total Marks
P.T.O.
3 of 28
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-32]
2. Compute all the basic feasible solutions of the LP problem : Max z = 2x1 + 3x2 +
4x3 – 7x4 s.t. 2x1 + 3x2 – x3 + 4x4 = 8, x1 – 2x2 + 6x3 – 7x4 = – 3
and choose that one which maximizes z. [10]
3. Solve the following LPP Max. z = 2x1 + x2, subject to 4x1 + 3x2 ≤ 12, 4x1 + x2 ≤ 8,
4x1 – x2 ≤ 8 and x1, x2 ≥ 0. [15]
4. 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
7.
A firm manufactures two products A and B on which the profits earned per unit
are ` 3 and ` 4 respectively. Each product is processed on two machines Ml and
M2. Product A requires one minute of processing time on Ml and two minutes
on M2, while B requires one minute on Ml and one minute on M2. Machine Ml is
available for not more than 7 hours 30 minutes, while machine M2 is available
for 10 hours during any working day. Find the number of units of products A
and B to be manufactured to get maximum profit, using graphical method.
[10]
9. A methods Engineer wants to assign four new methods to three work centres. The
assignment of the new methods will increase production and they are given below.
If only one method can be assigned to a work centre, determine the optimum
assignment :
Increase in production (unit )
Work centres
A B C
1 10 7 8
Method
2 8 9 7
3 7 12
2 6
4 10 10 8
[10]
10. 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]
11. x1 2=
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]
12. Solve the linear programming problem using simplex method : [15]
Minimize z = –6x1 – 2x2 – 5x3
Subject to 2x1 – 3x2 + x3 ≤ 14
–4x1 + 4x2 + 10x3 ≤ 46
2x1 + 2x2 – 4x3 ≤ 37
x1 ≥ 2, x2 ≥ 1, x3 ≥ 3
13.
A construction company has to move four large cranes from old construction site
to new construction site. The distance in kilometres between the old and new
locations are as given in the adjoining table. The crane at O3 cannot be used at N2
but all the cranes can work equally well at any of the other new sites. Determine
a plan for moving the cranes that will minimise the total distance involved in the
move.
NewCons. Sites
N1 N 2 N 3 N 4
O1 15 20 13 40
[10]
Old Cons. Sites O2 38 42 15 20
O3 25 17 30 18
O4 19 30 40 35
15. 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]
17. 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]
18.
A firm plans to purchase at least 200 quintals of scrap containing high quality
metal X and low quality metal Y. It decides that the scrap to be purchased must
contain at least 100 quintals of X-metal and not more than 35 quintals of Y-metal.
The firm can purchase the scrap from two suppliers (A and B) in unlimited
quantities. The percentage of X and Y metals in terms of weight in the scraps
supplied by A and B is given below :
Metals Supplier A Supplier B
X 25% 75%
Y 10% 20%
The price of A’s scrap is Rs. 200 per quintal and that of B’s is Rs. 400 per quintal.
Formulate this problem as LP model and solve it graphically to determine the
quantities that the firm should buy from the two suppliers so as to minimize total
purchase cost. [12]
19. A department head has four subordinates, and four tasks to be performed. The
subordinates differ in efficiency, and the tasks in their intrinsic difficulty. His
estimate of the times each man would take to perform each task is given in the
effectiveness matrix below. How should the tasks be allocated, one to a man, so
as to minimize the total men hours ?
Subordinates
I II III IV
A 8 26 17 11
B 13 28 4 26
Task
C 38 19 18 15
D 19 26 24 10
[10]
ROUGH SPACE