No. of Page(s): 2 Exam. No.

UMA20C53
THIAGARAJAR COLLEGE (AUTONOMOUS), MADURAI –9
B.Sc. (Mathematics) Degree Examination, NOVEMBER 2022
V SEMESTER SUMMATIVE EXAMINATIONS
LINEAR PROGRAMMING PROBLEMS
(2020)
Time: 3 Hours Maximum: 75 Marks
SECTION - A
Answer ALL questions: (10 x 1 = 10 Marks)
Choose the best answer:
1. Linear programming problems involving __________ decision variables can easily be
solved by graphical method.
(a) Two (b) Three
(c) More than two (d) Any number of
2. A basic solution to the system is called _________ if one or more of the basic
variable vanishes.
(a) Feasible (b) Non basic
(c) Degenerate (d) Basic feasible
3. If the given LPP is in its standard form, then the primal – dual pair is said to be
_________.
(a) Symmetric (b) Unsymmetric
(c) Perfect (d) Standard
4. _________ method determines an initial basic feasible solution which is very close
to the optimum solution.
(a) Vogel’s approximation (b) Least - cost
(c) North – West corner (d) Matrix minima
5. The assignment problem is a special case of ___________ problem.
(a) Travelling salesman (b) Matrix solving
(c) simplex method (d) Transportation

Fill in the blanks:

6. A constraint in an LPP restricts the use of __________.
7. If _________, then another basic feasible solution exists which gives an unchanged
value of the objective function.
8. If the primal problem is unbounded, then the dual problem has __________.
9. The solution to a transportation problem with m – sources and n – destinations is
feasible, if the number of allocations are ________.
10. The assignment problem of maximization can be converted into a minimization one
by obtaining ________ matrix from the given profit matrix

SECTION - B
Answer ALL questions: (5 x 5 = 25 Marks)
11. (a) Use graphical method to solve the LPP: Maximize z = 2x1 + 3x2 subject to the
constraints
x1 + x2 ≤ 30, x1 – x2 ≥ 0, x1 – x2 ≤ 2, x2 ≥ 3, 0 ≤ x1 ≤ 20, 0 ≤ x2 ≤ 12.
(OR)
(b) The manager of an oil refinery company must decide on the optimum mix of
two possible blending processes of which the input and output production runs are
as follows:
Input Output
Process
Crude A Crude B Gasoline X Gasoline Y
1 6 4 6 9
2 5 6 5 5
The maximum amounts available of crudes A and B are 250 units and 200 units
respectively. Market demand shows that at least 150 units of gasoline X and 130
units of gasoline Y must be produced. The profits per production run from process 1
and process 2 are Rs. 4 and Rs. 5 respectively. Formulate the problem for
maximizing the profit.
12. (a) Obtain all the basic solutions to the following system of linear equations:
x + 2y + z = 4; 2 x + y + 5z =5;
(OR)
(b) Describe the simplex algorithm.
13. (a) Write the dual of the LPP:
Minimize z = 4x1 + 6x2+18x3 subject to the constraints
x1 + 3x2 ≥ 3, x2 + 2x3 ≥ 5, x1, x2, x3 ≥ 0.
(OR)
(b) Prove that the dual of the dual is primal.

Contd……..2
 //2//
UMA20C53
14. (a) Explain the Vogel’s approximation method. Illustrate with an example.
(OR)
(b) Write the transportation algorithm.
15. (a) Write the steps involved in solving assignment problem using Hungarian method.
(OR)
(b) A company wishes to assign 3 jobs to 3 machines in such a way that each job is
assigned to some machine and no machine works on more than one job. The cost
matrix is given below:

Draw the associated network. Formulate the network LPP and find the minimum cost
of making the assignment.
SECTION - C
Answer ALL questions: (4 x 10 = 40 Marks)

16. (a) Discuss on three special cases that arise in the application of the graphical method
while solving an LPP and illustrate with examples.
(OR)
(b) Use penalty method to Maximize z = x1 + 2x2+3x3 – x4 subject to the
constraints
x1 + 2x2+3x3 = 15, 2x1 + x2+ 5x3 = 20, x1+2x2+ x3 + x4 =10, x1, x2, x3, x4 ≥ 0.
17. (a) Use simplex method to solve: Minimize z = x1 –3x2+2x3 subject to the constraints
3x1 – x2+ 2x3 ≤ 7, – 2x1 + 4x2≤ 12, – 4x1+3x2 + 8x3 ≤ 10, x1, x2, x3≥ 0.
(OR)
(b) Use duality to solve the following LPP: Maximize z = 2x1 + x2 subject to the
constraints
x1 + 2x2 ≤ 10, x1 + x2 ≤ 6, x1 – x2 ≤ 2, x1 –2x2 ≤ 1, x1, x2 ≥ 0.
18. (a) Use dual simplex method to solve the following LPP:
Minimize z = 3x1 + x2 subject to the constraints x1 + x2 ≥ 1, 2x1 + 3x2 ≥ 2, x1, x2 ≥ 0.
(OR)
(b) Find the starting solution in the following transportation problem by Vogel’s
approximation method. Also obtain the optimum solution.
D1 D2 D3 D4 Supply
S1 3 7 6 4 5
S2 2 4 3 2 2
S3 4 3 8 5 3
Demand 3 3 2 2

19. (a) A department head has four subordinates, and four tasks to be performed. The
subordinates differ in efficiency, and the tasks differ in their intrinsic difficulty. His
estimate of the time each man would take to perform each task is given below:
Men

Task

How should the tasks be allocated, one to a man, so as to minimize the total man –
hours?
(OR)
(b) A manufacturing company has four zones A, B, C, D and four sales engineers P,
Q, R, S respectively for assignment. Since the zones are not equally rich in sales
potential, it is estimated that a particular engineer operating in a particular zone will
bring the following sales:
Zone A : 420000 Zone B : 336000 Zone C : 294000 Zone D : 462000
The engineers are having different sales ability. Working under the same conditions
their early sales are proportional to 14, 9, 11 and 8 respectively. The criteria of
maximum expected total sales is to be met by assigning the best engineer to the
richest zone, the next best to the second richest zone and so on. Find the optimum
assignment and the maximum sales.
*****