This question paper contains 4+2 printed pages]

II
Ro N °· I \\\\\\\I\\I
S. No. of Question Paper 2843
Unique Paper Code 32357611 IC
Name of the Paper · Linear Programming and Theory ofGames
Name of the Course B.Sc. (Hons.) Mathematics-DSE-4
Semester VI Ho.11 2-0. f °t
Duration : 3 Hours ~aximum Marks: 75
(Write your Roll No.. on the top immediately on -receipt of this question paper.)
'
Attmpet any two parts from each question.

All questions carry equal marks. .. ·

1. (a) Find all the basic feasible solutions of the following

equations :

(b) · Let (x , 0) be a basic feasible solution with o~jective

8

function value z8 for LPP :

Maxiiniz.e z = ex

subject to

Ax = b

X ~ 0.

P.T.0.
 ( 2 ) 2843

By ente ring an a.i wit,h z.i -:- :i < o and removing a. ·br

· sub jec t to

. .. Xar M . .[:XB· . ].
- -_ = 1n __i : Yij > 0
Yrj . ·YiJ .
l .- .:
solu tion with
Sho w, tha t we can.. get ~ new feasible

n co~ par ed to
imp rov ed valu e of the obj ecti ve ~c tio

ng .sys tem of
(c) Usi ng sim plex met hod, solv e the 'rollow(

equ atio ns .
I
-·

8x 1 + 2x2 = 15

5x 1 + 3x2 = 19.

ase met hod _:

2. (a) Sol ve the .fol low ing problenJ ·by two -ph

Maximize z - . -x t 2x2

sub ject to :

J
 ( J J

M method :
(b) Solve the following linear program by the big-

Minjmize z ~- 3x 1 - 3x2 + x 3

subject to

XI + _2x2 ,--; X3 ~ 5

' - 3x I - - X2 + X3 ~ 4

(c) Consider the following pro~Jem

Maximiz.e z - --3x 1 · -:- • -2x2

-1) ; OH• I • < sub jec t _to

x2 ~ 3/2

Solve the problem graphically. ·

Programm ing
3. _(a) Write the . duar problem for the Linear
. problem_:

Maximize ~ ~ 3x 1 + ·~X2 + 7x3

subject to ·

-· X] . + X2 .+ 3x3 10

4x 1 - x2 + 2x3 .~ 15

·Xi, ~2 _~ 0, X3 _JS unrestricted.

P.T.O.
 (. 4 . ) 2843

linear
(b) Apply pr_inciple of duality to solve the

programming problem :

Minimize z = 2x 1 + 2x2

subject to

I x, + 2x2 ~ I·

2x I· + X2 - } ··
>

.wing
(c) Use graphical method to solve the-dual _of the-folio

problem :

subject to

r _,.,

rem to
Further, use the complementary slackness theo
from
find an optimal solution to the given problem

optimal solution of the dual problem.

 . .1' - ..-
~

(. 5 ) 2843

4. (a) -Solve the following transportation problem

D E .F Capac~ty

A 5 7 IQ .

B 6 ·. 4 6 &)

. 15
C 3 2 5

Requirement 75 20 50

(c) . . (i). . Define in "Two-Person Zero-Sumi' game :

(I) Saddle point .

(II) Mixed Strategy:

. (ii) Use -maximin and minimax principle -to solve the

game . :

3 -1 5

6 4 0
10 8 6

P.T.O.
 ( 6 ) 2843

5. (a) Solve the following 4 x -2 game graphically :

Player B
-2 0
. 3 -1
Player A ·
-3 2
5 -4 .

(b) Use dominance to solve the game

1 3 2 7 4
3 4 1 5 6
6 5. 7 6 5
2 0 6 3 1

(c) Convert the following game problem, involving "two

.I
,person;· zero-sum game" into a Iinear programming

problem for player A and player B :

PlayerB

3 -2 4:·]
-
[
Player A -1 4
2 -2

6 2,400
2843
 I

,]
[Thi s quc ,d ' " ~ ,imp er con Lns 4 prir. :d-i,ages
You r Roll No .. ...... ... .... .
1120 G
Sr. No. of (,.h1cstiori"Paper
\

Uniq ue· Pape r Cod e 2355 05

(P~p er V.4 )1 '
Linear P ogramming and The~ry of Gam es
Nam e of the Pap er
I

Nam e of the Cou rse f: B.Sc . .(H )ns. ) MA TH EM A ~I_CS. i•

I'
• • I

Sem este r v !olb - •'

I • •
•
I
I

1
Maximum Marks : 7 5I
(I Dur alio n : 3 Hou rs

•
Inst ruct ions for Can dida tes
.
. receipt of this qu~stio n papc;.
I. Write you r Roll No. on the to) immediately on

2. · Atte mpt any two parts of eac \ question. ,.· I '

3. All qui.: stion s carr y equa~ mar~.s-

'\

,, I

1. (a) Cliven a basic feasi~le solu tion x 8 = B- 1 b with z0 ;= cnxo as the valu e <)f the
nhje ctiv e function tq the linear {}rOgramri1ing problem : I

I
I

. -•1 '
f'vllnimizc Z ~° C X j ·, i

Sub ject to Ax =b
x~O •.
I
'
1
'
w that z(i is the minimu1~
i;u ch that zj - Ci s·o for ever y colu1nn aj in A. Shtj
thel basi c feas ible solut~~n i's ~
valu e of z subj ect t? the cons train ts and ·that
, .,.. • 1

opti mal feas ible sol~ tion .

1
,· '

Prov t: that if there is a feasible solu tion to

the line ar.p rogr amm ing prob iem :,:
(b)

Minimize Z =CX I .

Sub ject to Ax= b 11

',
X .2 0 11
I I I
.1, ..
tlwn, th:~re is a basi c f~asible solu tion to it. '1·1

0 I' . I .
II I

::,•,-, A I

1 . 1 . L~. I

. I
 , I
I . '
ne.
1

,f l "Y
\ ,,
'1120 2
__ _ . - ,,,, ' stem of equut ions : ·
I,
(c)
=2 x =3 x = I is a feasib le sowt1 on to th e sy
XI , 2 ' 3
x + ·4x, ==
I I
, I
I 2x; + 11 q•__J.-s:Y .,.-
'
+
I
,I
2 ·' . oCt --
gr . 3\ Xl + 5 X.\ == 14
. . . .
io . .
Is this a ba_sic feasible solution ? If not, reduce
lit to a basic feasib le solut10n .
1 . • •

· - . ogram ming proble m :

2: (a) Using Two Phase metho d, S()lve the 1inear pr _
Minimize z = x 1 - 2x 2
1

S ubject to
1
x,-+ X2 ~ 2
I . -x, + x2 :2:· 1
!
'·
I · .', X 2 -< !3
51 ,
,I
, ,1 ,x: > 0
,X !' 2 -
i. ,
1

(b) )Ising simple x ~etho d, solve the sysfont of solu~ion:

I
X
1
+ X2 = 1
,
2x 1 + x 2 = 3
I

and find th~ invers ~ of the coeffi cient n strix G:).

(c) Use the biij.· M metho d to solve thdo.l k>'.!in g line1L progra mmiu
l ·-
1I, proble m :.
Maxim ize • z = 3x 1 + 2x 2 + 3x . .
3 /
.I . :
Subje ct to 2x 1 +. x 2 + x 3 $ 2 I
3x 1 + 4x 2 + 2x 3 ~ 8
,·,
I
II

· 3. (a) (i) State'a nd prove~ the relatio nship betwe en J{e objec tive !funcl
lon value s

, I
I
' I
I
of the prima l and dual linear progra mmin ~ oroble ms. ; • N 6'-k.

(ii) Write the·dual ·of the follow ing linear prog~ a: .:1ming prpbl em
d
\
. .
vv..-4-~ 1hw1

·.· , I
:
I
.1 Maximize z = 8x I + 3x 2 -. 2x
3

; ,I
Subje ct to x1 - 6x 2 + x3 ~ 2.
5x 1 + 7x 2 - -2x 3 = -4
x 1 $ 0, x 2 -~ 0, x unres trict-:. d,
3
i
I ,
and verily that dual of the dual is ,,ima l ~robl~m.
(2.5,5) ·

-I
l.
«,~
· 1,1°

\
1l
I

I
 ·..' I I

I
I

3
I '1120

(b)
.
Verify that (wi, wi) =
(8s' SI) • '1
\
line ar pro gram min g pro blem :
is a feas ible solu tion of the dua l cf the

Minimize 2* 1 + 15x 2 + 5x 3 + '5x 4 I .

! '
Sub ject to xi + 6x 2
+ 3x 3 + x 4 .>- 2

-2x
: :I
+ 5x 2 - x3 :+ 3x 4 ~ -3
.
11 I 1 .
/

.
. :
· · !,. ·
Xi, ix 2, xj, x4
' 'I
;?: (J.
. ' . I

the opti mal solu tion of the prim al and

d'u1~,I
und use this inror met io9 to · ind I '
I
problems. . . ',
. . f
e the linear programming prob.Jem :.. I
. (c) Apply the principle of dua ity to solv
I

Maximize X = 3x I + "' ·'2 w

Sub ject to ·
I •
I I .'·
,·
I

I I
I

transportation problem :
4. (a) Solve the following cost ~minimizing

I ,D Supply
D, D2 3

9 8 8
o, 10

7 10 7
02 10 I

11 9 7 . 9
03

12 14 ·i 10 4
04
I.
Dem and 10 l·O 8
I

~
i'I '
p T.O,
I ·
.
.1
I

l }~O 4
I

(b) Solve the following cost-minimi: .ing

assignment prob lem :

A B C D
1 18 26 17 11

I II 13 2~ 14 26
III 38 1t
'1' 8
..
15

I
'.1

·1
l1 ·
1I
(c)
IV 19 1·
()_

Define saddle poi t of a two pe1• ;on

• 4:
1
10 l
zero sum gam:e. Use the min ima x ritcr
I to find the bes t st ateg y for each ,,lay ia
I
er for the gam e hav ing th e foll owi ng
,1
. I
pay off matrix :
II
I II
Pl& 1er II

., .
'·
1
I

·'
\
I
Player I [~2 ~13 1.
"' Is it a stab le gaJ c?
I •
(3.5 ,4)
I

' (a) Sol ve grap hica lly the gam e who se pay, ,ff mat rix is
'-·. I
I •.
I,
I
' I .
' f2 4 11]·
L7 4= 2
I
',
I
(b) Use the rela tion of dom inan ce
to solv t lhe g ame who se pay off mat 1
'
give n by rix is
. 1,
I
• I
I

. • 'I

(c) Red uce the foll owi ng gam e to a Lin ear

Prog1 ,mm ing Pro blem aml then solv
by sim plex met hod . e

I
'
.
.', I)

,I
•!
(28 00)
.I
[Thi s ques tion pape r cont ains 4 prin ted page s.]
6620 D You r Roll N 0 •••••• •••••• ••••
Sr. No. of Question Paper

Uniq ue Pape r Cod e 2355 05

r-., '
\ /

Nam e of the Cou rse B.Sc. (Hons.) MAT :JIE MAT ICS
er V .4)
Nam e of the Pape r Line ar Prog ramm ing and The ory of Gam es (Pap

Semester V ------
---------Max imu m Mar ks: 75
DeL• :ut3
Dura tion : 3 Hou rs

Inst ruct ions for Can dida tes

rece ipt of this ques tion pap er.
I. Writ e your Roll No. on the top imm edia tely on
2. Atte mpt any two part s of each ques tion s.
3. All ques tion s carr y equa l mark s.

ible regi on, ther e corr espo nds

1. (a) Prov e that to ever y extre me poin t of the feas
pro filem - - ~ - -
a basic f easi ble solu tion of the iinea r prog ramm ing

Min imiz e z = ex

subj ect to Ax = b, x ~ 0.

by the simp lex meth od starting

(b) Solve the following linear programming prob lem
with the basi c feas ible solu tion (x 1,x 2) = (4,0 )

Max imiz e -x 1 + 2x 2

subj ect to 3x 1 + 4x 2 = 12
2x 1 - x 2 ~ 12

x 1 ~ 0, x 2 ~ 0

ns
(c) x 1 = 1, x 2 = I, x 3 = 1 is a feas ible solu tion of the syst em of equ atio
x 1 + x 2 + 2x 3 = 4
2x 1 - x 2 + x 3 = 2
a basi c feas ible solu tion .
Is this solu tion basi c feas ible ? If not, redu ce it to

A1 :::. , , ;\1.- =- 1 PTO .

•', ( 0 I OI 2) n. ( 2.. / 2 / 0)
6620 2
2. (a) Using two phase method, solve the linear programming problem

Minimize z = 3x 1 + 2x 2 + x 3
subject to

3x 1 + 4x 2 = 11

x 1 1s . d , x >O
. unrestncte _ , x >O
_ •
2 3

(b) Using simplex method, solve the system of equations

3x 1 + 2x2 = 4

4x 1 - x 2 = 6 -
-2-
II

Also, find inverse of the coefficient matrix

(c) Using big-M method, solve the linear programming problem

~
/ subject to I

3. (a) (i) State and prove the Weak Duality Theorem.

(ii) Verify that the dual of the dual is primal.

Maximize z = -8x I + 3x 2

subject to x 1 - 6x 2 ~ 2

5x 1 + 7x 2 ~ 4
 3
6620
(b) Obtai n the dual of the follow ing prim al probl em :

Maximize z=7 x 1 + 12x 2 + 10x3

3x 1 + 2x2 - 4x 3 ~ 1
subje ct to
x 1 + 4x 2 - 3x3 ~ 3

x 1 ~ 0, x 2 ~ 0, x 3 is unres tricte d.

duali ty:
(c) Solve the follow ing linea r progr ammi ng probl em using

Minimize

subje ct to

4. (a) Solve the follow ing trans porta tion prob.l em:

D, D2 D3 D4 Supp ly ·

o, 10 2 20 11 15
(·t 3
02 12 7 9 20 25 J.i+ lif- ,t
4 14 16 18 10
03 ~35
Dema nd 5 15 15 15

em :
· (b) Solve the follow ing cost minim izatio n assig nmen t probl

I II III IV V

A 11 6 14 16 17

7 13 22 7 10
+ r; ±
B
7 2 2 2 .J_
C 10
D 4 · 10 8 6 11 ~t ~-t- f t-1

E 13 15 16 10 18

PT.O .
 4
6620
wing pay- off matrix :
(c) (i) Find the saddle poin t for the game having the follo
C2 / 1)

(-~ ~ ~1
I O -2
1-1
I
I
.;_-t I{_·H
that will rend er (2,2 ) a
(ii) Dete rmin e the rang e of valu es of p and q
sadd le poin t for the gam e

gam e to a 2 X 2 gam e, and

5. (a) Use dom inan ce relat ion to redu ce the: follo wing
gam e
henc e find the opti mum strat egie s and valu e of the fn, A ( { 1 0 J l/3)
-
~
~(56- > l,o
b
)
2 -2 31 -d:. I 2 -1 ~ -, " +
1

~ -3 5 -1 : v~ ½/;;3_
L1 3 2J

se pay- off matr ix is :

(b) Solv e grap hica lly the recta ngul ar gam e who

ef2. ~ [2 23 23 -6)] 4 ( t t)
I

2 3]- :l (o,t);_,o) 4 ), -t ~{ -t 3 & (o ,o,.1 l\,A

[ 3 8 I i.)" - )}
2.. v--5]1-- V-:=. "5 /i col ,l1~
-
ing problem and then solv e '2
(c) Red uce the following gam e to a linea r programm 4
by simp lex meth od.
~..f Y 1
' ..l :::'X1 ,t_.ltl-
Ml½ y
~· -& = 'Ji '-rJ:-t'Ji
.(. ~
,J, t ,l.., '--r-xl,' v I , ~ l-t1-:, i-r1Jj 5
2- ~tj °¥ ~ I
J
-2 3] ~

5 ·- 1 , ✓-t3~'~ t 1/t<r'd-f_..-?>~1~ f