EN/SC/MATH/UG/DSE/THO/2024
B. Se. MAEMAICS(HoS.) EXAMINATION, 2024
(3rd Year, Ist Semester)
LINEAR P'ROGRAMMING GAME THEORY
PArER: DSE-1A
Time : ivo Hours
Full Marks : 40
(20 marks for each iroup )
SymbolsNotations have their usual meanings
Use separate Answer scripts for each Group
GROUP-A
(20 Marks)
Answer any two questions
All questions carry equal marks
M l , x 2, N, 0 is afeasible solution of
the set of equations
15x +3r, -12x, +5x9
Find out the basic fesible solutions,
MATH-7
|urn Over)
(2 )
Solve the following linear
simplex nmethod:
Maximize Z=2x -3x
programming problen by
subject to
5x +4x,S 46
7x +2x, 32
2. ) Prove that x={(M; X)|X+ S50, x +2x, s80.
2x +x 2 20, x1, X; 20} is a convex set.
(b) Solve the following linear programming problem bytwo
phase method:
Minimize Z=x t x;
subject to
3x + 2x, >30
2x + 3x, 230
446
linear programming
3. (a) Find the dual of the following
problem :
unpecrice
Maximize Z=x - , +3x; +
subject to
/ Continued)
MATH-7
(3)
(b) Use duality to solve the
problem :
following linear programming
Minimize Z = +2x, +3x;
subject tuo
Ktxy +2x s8
446
GROUP-B
(20 Marks)
Answer any two questions
All questions carry cqual marks
1. (a) Derive a mathematical model for a cost minimizing
transportation problem. Show that every transportation
problem has a feasible solution.
(b) A
city corporation has decided to carry out road repairs
on main four arteries of the city. The
government has
agreed to make a special grant of 50 lakhs towards
the cost with a condition that the repairs
must be done
at the lowest cost and quickest time. If
conditions
warrant, then a supplementary token grant will also be
considered favourably. The corporation has floated
tenders and 5 contractors have sent in their bids. In
order to expedite work, one road will be awarded to
only one contractor.
MATH-7
|Turn Over]
(4)
Cost of repair ( lakhs)
R R R R
9 14 19 15
C 17 20 | 19
Contractors C; 18 21 | 18
C4 10 12 18 19
Cs 10 15 21 16
A Find the best vway of assigning the repair work to the
contractors and the cost.
(iü) Ifit is necessary to seek supplementary grants, then
what amount should be sought? 4+6
2. (a) If b, =c, - 4, -y, (i.j=1.2,..,.n) where n, and v, are
constants, then show that an optimal solution of the
assignment problem with cost matrix B= (h,) is also
an optimal solution of theassignment problem with cost
matrix C =(c).
Hindustan construction company needs 3, 3, 4 and
5 million cubic feet of fill at four earthen dam-sites in
Punjab. It can transfer the fill from three mounds A, B
and C where 2, 6 and 7 million cubic feet of fill is
available [Link] oftransporting one million
cubic feet of fill from mounds to the four sites in lakhs
are given in the tabie.
MATH-7 | Continued]
(5)
To
II II| IV a,
16| 1017 |8 2
From B| 15 13 12 13
C12|17| 20| 117
b
3 4 5
Solve the problem using transportation algorithm for
minimum cost. 4+6
3. (a) Show that in a game with 2 2 payoff matrix if two
clements in a row or column be cqual, then the game
has a saddle point.
Suppose that A is paid 8 if twocoins turn both head
and ifboth coins turn tails. B is paid 3 whenthe
two coins do not match. Given the choice of being A or
B, which one would you choose and what would be
your strategy?
(b) Two companies A and B are competing for the same
product. Their different strategies are given by the
following payoffmatrix:
Company A
B,2 -2 3
Company B B, -3 5-1
Use linear programming to determine the best strategies for
the both the players. 4+6
MATH-7 |Turn Over]
(6)
4. (a) Use dominance principle to reduce the following vof!
matrix and then solve it
(4 2 0 21 I)
4 31 322
4 37-5 12
43 4 - 2 2
|4 3 3 -2 2 2
(b) Solve graphically the game whose pay oflmatrix is given
below :
Player B
B B,
4
Player A A, 5
A, -2 8
MATH-7 XX-23(071)-70
