69721

M.Sc. (Hons.) Mathematics 5 Year

Course 5th Sem. (Current Scheme)
Examination - March, 2021
OPERATIONS RESEARCH - I
Paper: 12MHM-356
.
Ti111e : 11,rce Hours 1 [ Mnxinu11,r Marks : 60
Btfore n11s?ueri11g tlrt' qut'Stio11s, cnndidntes should t>11s111·,, thnf they
l1n1,e l,ee11 supp/it'd tire correct nud cq11117/ete q11estio11 paper. No
co111plni11/ in tl1is rt'gnrd, will be e11/ertai11ed nftt'r t'Xn111i11alio11.

Note: Attempt five questions in all, selecting one

question from each of · the /011r Sections (I, 11, Lll
and IV) and Scction-V (Question No. 9) is
co111p11lso'"!f•

SECTION - I

1. (a) What is operations . research ? Discuss its

methodology. 7,5
(b) Explain what are the requirements for a linear
programming problem.

2. (a) Define operations reseilrch model. State different

types of the model. 5 7
1

69721- IS'C ·(P-4)(0·9)(21)

P.T.O.
 (b) Give various steps involved in solving a Linear
programming problem using graphical method.

SECTION- II

3. (a) In the context of linear programming, explain the

following : 6
(i) Basic feasible solution,
(ii) Optimal solution
(iii) Multiple solution
(iv) Degenerate solution
(b) What do you mean by 'General', 'Canonical' and
"Standard' forms of a linear programming
problem ? Explain giving their characteristics. 6
\
4. Solve the follo,.ving linear programming problem
using Big-M method : 12
Minimize 8x 1 + 4x2
subject to the constraints:
3x1 +x2 ~27
XI + X2 = 21 .

X 1 + 2x2 < 40

SECTION - Ill
5. (a) Discuss the concept of duality in linear
programming. Give its uses. 6

69721- ·(P-4)(0-9)(21) ( 2 ).
 (b) Find the initial basic feasible solution of the
following transportatiqn problem using Vogel's
A.pprox1mahon Metho d (YAM) . 6
To
D1 D2 DJ D., Ds Availability

01 1 9 13 36 51 50
From 02 24 12 16 20 1 100
o~ 14 33 1 23 26 150
Req uirement 100 70 50 40 40 300

6. (a) Explain how transportation problem is a special

case of Ii.near programming problem ? 6
(b) What are trans-shipment problems ? I-low these
problems are solved ? 6

SECTION-IV

7. (a) State the common and distinguishing features of

the assignment and the transportation problems.
(b) Explain the follo,ving:
(i) Pure and Mixed strategies
(ii) Mi.nimax-maximin principle
(iii) Stable and Unstable games

8. (a) Solve the following game using algebraic method :

1 7 2
6 2 7
5 1 6
 (b) Whal is ,concc.!'pt of dom inan ce in gam e theo ry ?
Expla;n. • 7, 5

SEC TlO N-V

9
1• (a) Gi,,e maU1cmali,cal formulation of a gene ral linear
prog ramm ing prob lem .
.
(b) E-x.p lain in shor t d cgcncrilcy in trnn spor tn lion
1

prob lem.
(c) l)iffe renti alc bct,, ,ecn 'slac k' and 1
S\1rplus'
varinbl~s givinA suita ble t'Xampk~s.
(d) Stale hov..' \\'ill vou
~
hand le, unba lanc ed
trans port ation prob lems ?
(c) Wha t is a fair ,gam,e ? Give an example.
(f) Writ e a shor t nolc on lra,velling sale sma n. prob lem
2x6 =12 .
 69721
M. Sc. (Hons) 5 Year Course ~th Semester (Current
Scheme) Examination, November/December-2019
· MATHEMATICS
Pape~llMHM-356
Opentions Research-I
1uM allowed: 3 hours] {Maximum marka : 60

N•: ~ttempt any five questions In all, :,electing one

question from each :,ection. Q•estlon nlllnber 9 of
Se llvn-V Is compulsory. A.II questions carry equal
a1rb.
-• Section-I .
· C.1 . .'
L (a) Discuss methodology and scope ·or operation
- . :
research. ··.. -~ . 6
. ,, ,. -
(b) ElCplain-,.graphicaJ ._method-to·· solve a linear
• ~

- - ~gramming program and give example. ·6

2. Find the geomemcal interpretation and solution f(!r the
following LP problem .
Maximize z=3x1 + 5"2
~ject to the condition :
"i+~ ~ 2000, "i~ ~ 1500, "2 s 600, and x1 :i:!:: 0, "2 ~ 0.
12
Section-D
3. (a) Explain the following terms :
(i) Basic solution
. .
69721-P-3-Q-9 .(19)
 \

.. ' ( 2) 69721
.
. ' '... . .

. '••· .· (ii) ._ Degen_erate solutio~

(iii) Infeasible solution ·

(iv) Optimal solution 4

(b) Explain Big-M method to solve the LPP. 8

4. Solve the following LPP using two-phase. methqd.

·Minimise z . x1 + ~~ubj~~
. .
to 2?C1 }'2 > ~, ~:+-
..
7}'2 ~ 7 f :
'
· and-~,)S~O. 1•~·- . . ·. '"·· .. _ • ,· · .•.;,,-,:·.. 12
.... '
.~:~\ ·.· ' . .. .
,. S«tioa:-m ' '

5. (a) Define primaf and dual problem. Is the number of

· · . · : ·. constraint in the priny,'-~d.4ual the
~ .
~roe with
. --
the-
-~ ·
.

. help ofex&q)1e? .·· •. . . .:,: . 6

....;I
f· J..•·,...,
·- ·1···•.-,;-~ . .
' .J ., • • ~ - ~~,r-•.C...

. · .::.. (b) ~•:

•
•-;...:. . .. ... -· ' < I·•,
, ,,. • ··• •· '••.·· ., ..
.'

. -:,, .·1• •·• ·•••' · •~,,... ..,-..J- tr!ananortati

Explain tlieaiffaen~
-~ oJ.':' ....
--.....,
• -,
onand ~een . . .

·
. :;l,.! .. . ~ h i ~t probl~ . _.,, ·: :·~·--,·.i r,.,._; . . - -6- ··-
_, .. . ,1 •'-• . . ,..... •• ·•r-.· 1 ' r • · ·• •
• . .,·;, ,,. . ::.:! ,; ., ...... . ·~
6. Determme the optimum b~ic ,feasible solution. to the
.... .: 1. • • .
following traosportaµq~ problem. . · ·
. . . .. • I • .• ..
A B C : •.·Available ..
I: '
so· .J o 220
J..-
,· \,i.J
.,: .~ 1
•· From II 90 45 170 3 •

To m 2so 200 so 4
Required 4 2 2 I •
.
' 12 -
_(j9.72l
 ,.~. (
A / ;

(3 ) -69721.
Section...:IV

lain H un ga ria n m etho d to solve the assignment

7. (a) Exp
.. . . . 6
problem.
e as si gn m en t pr ob le m an d discuss about
(b) Defin
sm an prob le m . 6
travell4ig sa le
. te gies.
'
2
8. (a) D ef m e pu re an d m ix ed stra .
t Tw o:.P er so n an d Ze ro-Sum. 2
(b) D iscu ss ab ou
ou t Pa yo ffm at rix . 2
(c) E xp lain ab
th e gr ap hi ca l m eh od for solvin g mixed
(d) Discuss
es. 6
strate gies ga m
a- V
..• · Sectio
. a simplex
is th e to le o f·p iv ot elem en t in
9. _(a) ·What. ..
: ,.~ "' -. , ·~,....
,
method? · . "" -
,,.,.,,,..r1, :t-e"
.....,.r···
. ' :
. . ·
Qegne Jllultiple solutiorr; - ·- · ·
.·
(b)_
I,. --
~~
P.
( c) Explain the advantage o fduality in LP
t do yo ~ m ea n by no n- de ge ne rate basic
(d) Wha
n problem.
feasible solution o f a transportatio
' _
ef
.
in e sa dd le po in t an d va lu e o fga me.
( e)_ D •
•
th e co m m on fe atur e be tw ee n as s, gnment
( f) What is
an sp or ta tio n pr ob le m ? 6x2= 12
an d tr
 •
• 69121
~
1
.Sc. 51h Semester (llon11) 5 Vrnr CourNe (Current
•
Scheme) Exn1nln~tl,1n. Orct•111her-lO 17
MA1111~M~r1cs
t•apcr 12-MIIM-356
- Openatlons Rcsenreh-1
•
Y,llo'K1cd: 3 hours] · [A·lax/1111111111111rlc., : 60

lj: Allcn,pl fl••e q11c.•s1io11.f ;,, "''· .11,•/c.•,: lill},! tlllC (JIIC,l/l/011
•
•, . fro111 ca,:I, of /he scc:tio11.\· ( I. 11, 111 a,ul IV) 1111,I
-~ectlon-V Is con,pulsoT)'.
- Scetlon-1

R) . ~~~pc.
Defin_e·•opcl_'tltions Research' . (i~~c ils_ .
(b) E.-<plain, ,vhat are the rcquircn1cnts .fc.1r u lincur
programming
. . problem. ·. 7 .s
. ..
· What_ore operations research 1noc.l9ls ? Give
diffeacnt types of the 1nodcl. . . . . ' •

Explain in short grnphical method lo s9lve lincnr

programming pr<_>blcms.

SectJon-11

Expla.in the following in the context of linear

•
•
programming:
(l) Du.sic solullon

(ii) Optimal solution

 ..
• . ( 2)

(ii i) Dc ge llc rn tc so lu tio n

. ....l •

• ..J
(iv ). M u_lti pl e sol~tion. . .
(b ) . W ha t do yo u mean .by
'g~ ne ra l'. 'ca no ni ca l
•stnn ctn rd ' fo ~ ·o rii liriea i' pr og m m m. in g probl..
.. .
~
Al s~ , gi ve th eir ·c_h ar ac tcr ist ics . , . ..
. .
pr ob le m _·
4. SQl~e th e fo flo ,vi ng li! lea rp ro gn un i:r iin g
Bi g- M me th od . . . . '
M i_ni m iz e Sx1 + 3"2
.. . . ' .
•
$Ubje ct to 2x,+~~· s 12
..
.•
•
:. . 2x ,+ 2~ - 10·

..
, .
.. \.
- .
. •

Section-Pl ~::. . .- ,· _.. . .. •

•

5. . (a ) Ex pl ai n ·th e oon,cept of du al_ity in 1

•• . ·)··
(b ~
p robtg.~m•th~~dng.a1W.batf ar..e i~ ad~antagcs
?
i]
j
.O am e _u o .tQ110~1ng lin ea r pr og nm
probiem :. . .. '
. ' . .. . ..
.' .
~ 3~ ,-2 "2. + x_,
.
s·s
' .
'.
.. . .'
su bj ec t to 2x1:-·3"2 ~
.. . . . 4"1:--:
2"2 ~ 9
. . . .
- ~~.:+4~ +3":,= 8 . .• .
·x ,, "2 · ~ o. x;·is u~ st ri ¢t ed .
 (3 ) 69 72 1 """
r
I• '

.. un sp or u1 llO O P
ro t>l cJ U ·r oa vc
LI) , v 11nl ur c tr f th
( • problem. A ls o
llli \lh\!11 \t\U.Ca 1 ,o
" nn uln t1o n
.
o e
t . . .
give the ir types. • . ~
. 't ns po
d
Di ffe re nt iat e hc t,v ~e n ro rta t1 on an
·
•
'tr an s-s hi pm en \ pr o em s• Explain,
bl ho w n
S7
trans -sh ipm en t pr ob lem can be solved.
,
•
Se cti on -IV
. .
Defi~c the fol lo\ vin g t~ons and giv e on e ex
~p le
·or ea ch :· ..
(i) 1\v~pcrson zero-sum game _
(ii ) M ixe d strategy gn me
(ii i) SadQle po int , an d
. . -- --
•
(iv) Un sta ble go.me. ·
W ha t is do mi na nc e ru le in ga me the or y ?
Ex pi ai n•
by talcing su ita ble cx nm ple s. · ·· . 6, 6
Solve th e fo llo wi ng as sig nm en t pr ob lem . ...••
:
.. Mn n .
·1 n m IV . V
11 .
17 8 16 . 20
.. 9 7 •
12
. 6 15
13 . 16 15 12 16
.. ·... 4 I . 21 24 27 .. ~8 26
' s. • 14 .10 12 •
11 13 12
•·•
1
 .....,

( 4) .
. . . . . 1' --
·. 69;•
. ' .
.. . . '. .
.Section-V :· j
.J
• • . "J'
(a) Give math~tical formulation ofa general i
.
progr~g ~-r oblem~
. .
-· .,.]
• •. :1
(b) What do you mean by •degeneracy' i n ~
• problem ? · . . · . · j
•
•
•
(c) Differ~ntia.t e.·be~,ve~n 'Slack' ~nd.'.Su
• •
1
variables. giving suitable examples.
.
(d) · Explain,. what is~ ctravelling salesman prob
.. Ji
(e) What-is •r*gani~'? Give an example.
. .. .
·1 ~
• , :;a

(f) Ho,v 'Unbnlanctd' transpQrtation problem

. .,
. ·.solved? Explam in-short. ·. ~
• ,.
 \

69721
•
·M.Sc. (I-Ions.) Mall1 FivepWa'i(;oi1rse ·
e • I

5th·Semestcr (Currenl:s'cheme)
• ' .
•

E~amination - .Dec_emb~r,-2016
. I

OPERATIONS RESEARCH-I
.. • I

P.i~r : ~IJIM-356 •
. •
Time: 11,rtt I lours J ., • f ,w;a/,rti,~~Mii;ks : W
..
. ~Jon: a11sin:ri11,~ tlit qutsliu,is, a11ulidates siiciiJafnsii" t1in1·11,ey
. • .
luror l,-r11 supplied the co,,~1 ancl co,nplele qw:stion l"'P•'" No
• I • "-• •

co,~int in this rega11l, will bt e11lerlniiu.'11 nftu ~ni;nntio,,. ·.

. . . - . """' ~

. five questions in all, selcc,mg .orie-qucstion

'Nole: Allempt . .
from each Unit. Question N.o. 9 is compu_lsonJ. AU
qul'Stions carry equal marks.
-
UNIT-1

t. w,Disa&SS ~elhodology of operati~r:~arch.

(b) Whal are operations research:' nixlels ? Stc1lc
'
different types. of
. .lhc models. 6,6
. . .
69721-I Sb ·(P-4)(0-9)( 16) P. T. 0.
 !.' .! . • ,,., ..tr p rogrammin g p ro~l~rn. \'lh. art
11
, l .,. , · I". 111 · r,L·n t.. for the p roblern? 6 ,,
d ,I

•
. •
f1 1I I· •1· · •
,, ,·
.•.• ,-,ill you solve .a linear prog~, rn ...
'"·-~•un :_"
0
pr;) ;l,-rn by br.:iphiral method.
•
UNfT - 11

3. (il) ~ fine slack ~urp lU5 and arti:licial variables USl'd

in·li~<.'ar programming problems. Give suHab,
. ~amplcs. 6, 6
.
{b) Whal is _t~o ._p hasc method lo so~vc a linear :
. .
program~g problern ? • .

'_1/5°1vc the foU~wing tinl'il~ prog ramming problri,,-

using Big-M m~od : . . · -. .. 12 '
•
· • Maximize Z = Sx1 - 2.r2 + 3x3
-

2x1 • :ix2-l"3 ~2 •
Subject to . _3;t1 : 41·2 ~ -~
,T2 ♦ 3.r3 S 5
.. •

. UNIT- Ill '

5. (a) Obtain the
dual of lhl! foJ16w ing lifd1
P,:Ogrnmming problem : &. 6 •
...
. . .. .
6!1721 - ·IP·◄)(0-9X iG)· . ( 2) ,-
 \ I •· rJ I .
'/ · 111 , 3.ri ·► '1.r3
I I t • •I • ,-

2;r l t 3.r2 t-5.T3 ~2

:{r 1 4 .r 2 -t-7x, == 3
SubfCI to x; •,Jr2 +6.r3 .S 5
t , 1 2 ~ 0, 1·3 is unrrstrictt'Cl
1

lh,,t do yo u.,mean by transpornrion problem ?

• (lJ) ~\
.. any one m etho d lo !ind initial basic
;.·
•
Explain
•
fcasible solution of the problem. ·
•·
.
~

~
:.. .
;. . 12.
~ 6. So lve the following tra nsporalion problem : .
•
r
SuppJy I
I

Ot.'SIUtillio11 .
D, D1 . Dj D4
.
o, l 2· 1 ..'4" .
30 .
3 2 J .• 50
Orjgin Di 3
0.., •1· 2 5 9 20
f Demand 20 . 40 30 JO. 100
L

. ·-
UNIT'- IV
ie~ :··
) Sol~c thl' following assignment prob 12

fi ··· Man UI
..
I~· V
Lr . I U
A J 3 2 3 6
:rask 8 '2 4 J 1 5
6 .,. . . 6
C 5 3
D 3 I 4 2. 2
E 1 5 6 5
"'
 De fin e a ga m e. W ha t ar e i,S proper.ties.7. 4, ·
8. (.1) J.J
is : .,
(b ) So lv e th e ga m e wh os e pa y of f m at rix . .i,
•
·9
6 2 4
8 .·i,.
.,;
••.. • 6 .- ] l 12 .j

2 3 3 9 1
l l'

. 5 2 6 10 I
•

. UN rT -V • •
•
res ea rch ? 2 x ~
9. (a) W ha t do yot1 me ~n by op er atj on s
.
(b) Dcfin ~ fo llo. wi ng in the co nt ex t of
. .

pr. ogramming: .
. ·.. )j
· (i) Basic so lu tio n . : ·-··-

. · - ·(ii) De ge ne ra te so lut ion

· !
.Qilferentiate b~hvem B? la ~e d •an d .._tnb. alanc euii
(c) _
~,
tra ns po ra tio n pr ob lem s. i
-:-~· . . . .. .
y. ~
.. (d ) Gi ve ru le 9f do mi na nc e in ga m e the or .
• . .• •. .
.• .... . •
. ':i ~

(e) . W rit e a sh or t note! on · tr. tve lli ng salesmanf,. •l

i.
pr ob lem . • •
•
- - --·
in g.
, (f) M en tio n .tis es of du ali ty in Jin ca r pr og ra mm
•
 (4 )
69721
What arc trans shipment problems ? How these
69721
M.Sc. (Bona) 5tla Semeeter S-Year Current Scbeme
are solved?
6,6
Eumination, December-2015 •
Section-IV ·MATIIEMA11c:s
,. Solve the following assignment problem :
. ' Paper-MBM-356
Operatlona Relean:h-1
Man
rune allowed : 3 hours ] [ Maximum marks : 60
I D m JV V
A 1 3 2 3 6 Nou : Attemptftw quutlo,u in all, selecting Me qu,urton
s from etu:h ofthe four •«tlmu (1, n, m and W) and
Task B · 2. 4 3 1
Sec~iOlf-V Is con,pubory.
C 5 '6 3 4 6
1 4 2 2 Section-I
D \ 3
E 1 s 6 s 4 I 12 1. (If) Discuss the scope of'Opcrations Research' .
8. (a) Discuss 'Concept of dominance' in game. (b) What arc 'Operations Rc:scarcb' models? Give
theory. their types. 6,6
(b) In a game of matching coins with two players A 2. (a) Explain requirements for a linear programming
and B, suppose A wins one uditofvalue when th=
problem.
are two heads, wins nothing when there are two
tails and loses half unit of value when there is one (b) Give various steps involved in solving a linear
head and one tail. Solve the game using algebraic programming problem using graphical method.
' method. 6,6 5,1
 Sectio-n primal problem :
"'11111111
3. (a) Define the following terms : Mioirniu Z • 2x1 + 3x,.+ ◄x,
•
(i) Basic-feasible aolutlon, subject to constraints
(ii) Degenerate solution,
2x1 + 3,s + Sx, 2: 2
(iii) Slaclc variable, • •
(iv) Surplus variable. 3x1 + ,s + 7x, = 3
(b) Explain two-phase method to solve linear x, + 4,s + 6x, S 5
programming problems. 4,8 x,' "2 2: o. X, is unrestricted. 4,2,6
4. Solve the following linear programming problem using 6. (a) Find the initial basic feasible solution of the
Big-M method : following transaortation problem using Vogel"s
Min. Z = Sx1 + 3,s Approximation Method (YAM) :
subject to
To
2x + 4,s s 12
1
t>, D2 D, o. D, Availability
2x1 + 2,s = 10
5x1 + 2x.i 2: 10
o, 1 9 13 36 51 50
x,. "2 2: 0. 12 From 02 24 12 16 20 1 100
Section-ID 01 14 33 1 23 26 ISO
5. What do you mean by duality in linear programming? Requirement 100 70 50 40 40 30Q
Give Its uses. Also obtain the dual of the following
69721 , 69721 [P.T.O.
 ~,1
C5J 19721--. ~
'fl ll!il
II
!l!i
Ii

I. (al DtOne ~ i w R ~ ' .

11

" fftJ fflrll 1111 ~u D1ta ll "11 15IMIW'd rmm I nr lfna t

pi ~ 11t11ffll probltm 7

!• (c) !.tp~ain lllcgtud.K]f in ilm1 ,mmblam

~ t(eJ. In linc u i"Fl'JIIDnmi nc p.rnll mi,. wb.a.1 is

@gplnmt salurJiDn (ii) IJibvuudciJ solumian.

• CO Wrirc • ,lion DDIC on ~w.o -Ptti ian-Z c~S um

r.amc1i ! J X'
 •
~~te hc;,w. will. ,Y~.. ~~ th~..foUowirig
~
aituat;ion• IA aa. ~mgnment pn,btem. · 4
RoQ No.1~~§.<:i.~
(i) . UnbaJanced ~ b l ~
' (ii) Maximiza~n pr.oblem, · · 69721
SECTIOlf!-V
M.Sc~ Matha (ilo-) l'lve Year
·5th ·S emester (Rew) E+•mtn•tioa-
1• (a) S_tate any two requ~ments for a linear
. December, 2014
programmmg problem. 2 oPBRATio•a
. . RBSMRCB-1
. ,..
.4Ji,) Define , 2 Paper : NB¥ 3!16
. .
(i) Basic ·so\ution,-end · Ttme : 3 hours . · . · · ar«--. • • kt _ 50
(ii) dptimal ~lution in ·: linear .Before . answering ~e questions, candidate•
programming problen:is. should ensure• that. J;hey have been supplied
_j9- What arc tranaahiP.ment problems ? 2 the correct and complete question p&pCT, No
co_m plaint in thi& ·regard will be entertained
-tdf Give. 'rule of dominance' in game theory. afte'i, the examinati.2,n.
" '· 2
_Jpr Mentio n two main c haracteristics of ·a . Note: Attempt . ftve questions in all ecJecting
one question f'~m each of the Sections (1,
.. research model.
good o pcrati,ona 2
ll, Ill ~d lv.1· ·Scction-V is compalaoly.
JI}-'" Explain ~c term. 'saddle point'. 2 ,· .
• • • I
. '
~011-i
· ·... · ·. 1. Jar-Define 'Operatio.:is Rc~h'. Give. its
scope. 7
. .
.fb,What arc ;Operations Reaearch' models?
. types. of the modela.
~tatc ~cr:cnt · 5
2. (a) What ·<to . you . mean by linear
programming p.roblem ? Give
Ant-~ (N)(0-8)(14) (4) 88721 -20C>-(P-4)(0-8)(14) ( 1) (TI.Wn°"91'
 • • -~
'
mathematical for.mulation :- or ; general
r ~) - -
..tbf ExpWn how tl'aMporlatlon pr,<>ti
Jmear Pl'Oiu"~ng problem. · 6 speciaJcase ~near . ~:ll
problem? ·
Will yuu solve
• Unear
proga amnung problem by !P'Phical '
method? . . 6 6. · Solve. the following traneportatiQn problem :
·• . . . . 12
BBCHOB-n .
. . To,
' oj . DJ .o, Supply J
3. Solve the follQwing linear programmjng
. t•· . From o.
.
.
2 . ? . ' 4 5
.
problem using Big-M method : · 12 <>2 .3 3 '
l .
8 '·
Mininme 8x1 + .4X2
. .
. o, ' •5 . t ·. ' 7 7
Subject to constrainta o. . I 6 2 14
. .
·: li.i'"'t- X2 ~ 27 . ~~ lJ)emand
j
7 9 18 ~3"
XI + X2 • 21 .
SECTJOR - IV
XI+ 2"2S:40
x,;~ ~ o .. 7 . (a) What are assignment problems ?
Differentiate --between transportation and
4 ; Jar"Explain alack, surplus and . artificial
assignment pr,oblema. 6
variables taking suitable examples. 6
(bl Explain the following terms : 6
. . (i) · Pure and mixed strategics
(b) Write. a note on Two-phase Method' u sed
to solve linear programming pi:oblems. .(iii :M~imax-~aximum principle
6 . (ui} Staole and unstable pmee.
8. (a) ~Ive the game whose pay otJ matrlx is : 8
81lC1JOR-m
6 2· 4 8
.. . 12 - 1 1 12
5. jay'Discuss the •concept. of duality in linear
· programming. what are ita advantages ? 2 3 3 9
. 6 . '52 · 6 . 10 ~
89721•200-(P-4)(0-9i(14) ·( 2) &9721 ·2<>0-<f>-4)(0-9)(14) (3 ) l Tum Over
 •
697·2:t
;If.Sc. (Hons) Mathematics s~Year
6th Semeste·r (New) Examination-
.· .. , •,• December,-·2 012· ...
Operations Research-I
Paper ~-356
i .
.l . Tl.me: 3 hours - . . · · llax. Jlfarb : 60
. .. Before answering the__questions, candidates
shpuld ~nsure tl)at they have been supplied
•J'•
the correct and complete question paper. No
complaint in
·this regard ~l .b e en~e~ed
after the examination.
;:
-- • -
!! . . .. . .

'.l :Note
..
: Attempt. five qu.es~ions i~ an. selecting
.. . .
.,,one question from each of the four
. Units .
..• .. . .
.
!
I
t. (I: II, l!J. :and IV) and Question Ho. 9
t (tTnit~V). is 'com.pulsory.
t
f
•

UNIT·- I

1. (a) What is 'operations research' ? Di~ss

• •
methodology of operations research.' . · 7
It9721·200-(P-7)(0:9)(12) ( 1) (Turn Over
! -
 .
- (b) ~ ~ t ar,: the reqwremeiita for ,
' .
~ quality-S petrols for the next ~ t h . l\
)las available 1,500 units of crude A,
linear prognmumng probleni.
1,900 .units oI crud~ Band 1,000 unit.a of
..... . "ij'
... . . . •·
crude C . . For each unit of quality~R the
2. (a) An oil rdlnery can blend three grades or
.
refinery receives Rs·. 60 •while for each '
crude oil to produce quality•R and
uhit of qu~ty-S petrol,·it receive a- Ra. 90.
. quality-S petrola.• Two pouible blendins
.. . ...... ~ Formulate the problem as a linear ·
available For eedi
. . ~
production run the older process uses s!_; programming problem t6 minimize the
. .. 10
units of crude A, 7 units of crude B and~ . revenue.
. t'
.2 units of crude C to produce 9 units-~ (b) ·oive limitations of Jin~ _programming
.
. .
-·
quality-Rand. 7 units of quality-S petrols.::~ technique. 2
•
The newer•process uses 3 units of crude~
·-• .
· ' t 8 of'
- .uN1-X-D
-
A, 9 unit& of .crude. B 8:ftd 4 uru ~ ·. · '
crude C to pr~uce 5 .units _o! quality- i .~ . (a)' _D efme the. following ·: ,·
and 9 units or.~ality-S petrols. ; . (i) Basie solution v'
./ 1
Beai•,se or prior,. contract conunit:"1en~ · (ii) Optimal solution / 1
• . 'J, . . i .
. the refirlety : Dlu·s~ produce atleast 5~ . (iii) Degenerate solution .1 l
units ol quality-R· and atlcast 300 uniui -(iv) Artifl~ varia~lc✓ l
· · ~ '8721 ·~ (P•7)(0-9)(12) ( 3) · (Tum Over
 • •
•·
(b) Explain Big'-M method to solve line;u: : (b) ~•t are the tranaporaUon . problem• ?
'\1 _,
r ~ing problems. 8. Give mathematical formulation ol •
~ - .
4. Solve the followu,g ~ programmino 'I. general iranspontion PfObkm.
,,.,, . 4
problem using two-phase method :
. . . . .. . . .. . . .. ~ ..
12 "~
. . . .. . 'i ..
I.'

6 . (al Solve the following transporation problem

.. '. . .. . . . '
ueing modified distribution method : 12
-
Minimize i! • ·"• +.r z i:
.. D1 0, OJ Available
Subjee~ to 2x1 + X:l ~ 4 · 0/D
'(
i . L._, .
01 6 · 8 4 ]4
X1 + 7x2 ~ 7-
. . ~
0, 4 9 ,3 12
Xt, X:i ~-0 ·,
I Q3· 1 2 6 5
UNIT - '111 . -- -
Requirement 6 ]0 ·15 31
S . (a) Obtain the dual ·.i?f the f.:,J:o,ving iinear
.
./
'
programming problem :
.
8 ..- .
UlfJT-1V
~
Min_imize i!,. 2x 1 - ·2x3 ♦ x~ .•·..,
• .
~ubject to 2x1 - 3x2· + XJ s 5
•
• 7 . (a) State the common an~. distinguishing
.
/

4x1 -2x2 ~ 9
- 8x1 + 4x2 + 3:xs .. 8
I,l
·,; i

features of .. the assignment and the

. transporatien models. '
6
118721 ·200-1 P -7)10·9)( 12)

x1, x2
( 4)
~ 0, XJ is·unrestricted.
J', ' .
19721-200-{P· 7)(0-9)(12) (5) I iu111-VYar
l
- (bl Explain 'Hungarian ·method' uaed to aolve • (iii) Differentiate between 'alack'~. ·
. vanablea.. Explain with an exam;~3
~
aaalgnment probiema. 6
(iv)"What do you mean b.r ~ t y la Jtnear
.. . . . . .. . . .. ... . .. ' .
L (') Exp~ : ·3 . prog;smrning
. ? \Yb•~
. . . are
. . ita
. . uaea
.. . ? l3
(J) Niud strategy game, and .,,
.
r (v) State· bow will you beadle the foDowina
situations in an auip,ment prohlera ? 2
(ii) ( Two-~n zero sum game ::?i (a) Unbalanced problem
,,' - '{b) Ma-.cimization problem
(bJ Solve the game : ~
9
~-
i.· (vi) Give an e>co;taple of a fair game l
J. 2 -I 0
L.--\ ,,I-;
J • 2 • ..''
4 2 4 I
J • 3 •
..-
UlflT-V
~
.9. ('J Mention ~ types of . o~ration a ;
reaean:hmod~J• .- ~ 2
(ii)
.
What are linear progra.mmmg_,,,,
problems .
..
?
1