\

tllcrych /np.ril - 2olL

'E*fai No. *f euasti*trs : Sj
SEA{'fi$" :
F6987
, ,3Be& [ fl*tai No" $f l,ag*s
[58 65j "." :E
4
F'&rsr Yeat IB6.C"A. 1-1 gE{}
EEGO, :1-ia,itt _4_
&raL.4r*: It 4*;-:r { 8r.. t
L {{r-igJ ji
la/g r'*.,&-L
1vi ,t "
-f . TsllcHNrQ{JiXS
L'BRARY
(2 ) (Semester - II)
'l
Time:2% Hoursl
ffuIcr. Murks : 5, rr
Instructiorts to the
1) Ail
2) Use of tron progysmmable calculator is allowed.
s)
fall ntarks.
Ql) fb MCQs (0.5 mark each)
t10l
problem call be converted into maxt,t:tlizatlon
') problem by
L the sign of coefficients in the
a t b) obj Function
C Both a arld b hI the Above

i, The order in which machines

completingjob is callecl as
a) Machine order Job order
c) Processing order Working order
a
ii, always
b) zeto
d) same as

L Problems based
'v) referred to as "*"tri;
phenomenon of crecision

c) Probabilisticproblem d) None

v) The saddle point in payoff matrix is

a
a) largest number in the matrix
b) smallest number in its column
number in its row
c) smallest number in the matrix
d) largest number in its column and the
Smallest number in its row

P,TO.
 !;) As si,"i-,ulatloii i s not an anaiyticai irreiei, ritreiorc the resuir.of's:i,rLir!:,rrn
;nust be view ed as
,t
a,\ ljnree*istie h\
t. '
rr-^^+
Lialt,l

,.i
t') Approximation ..,....
{ii Sirnpiitied
LTBRAFY

4
ft vii) If in a LPP, on CI.It a variable can tre made intinity large r.viti,irnt
violating , the solution is
a) b) Unboundeci
c) cl) None of the above

viii) if srnallest tirne for a job bel ongs to machine A then ti:at
tq torvards in the sequence.. ,

a) b) left
c

ir) Backward Pass

e times
of events
a) tentative
c) latest

x) In the Hurwicz of Pessimism is rienoted by

a)a b) t- a
";'' ,"-...,.-:

c) 7ta # d) a' .*",.

.+.
'a..--'

xi) In a mixed strategy, each player should optimize the

a) maximum payofi's b) lower
c) maximum d)

xii) A problem is classilied as Markov chain

a) There are finite number of possl
b) States are collectively
exclusive
c) Long-runprobabilities of being in a ar state will be constant
overtime
d) All of the Above
[s86sJ - 2As ,
 xr1;,} ln simpi*-x.lneth*et, if there is rie lie*v tt{t, a deeisir:n v. ariabie ancl :; qinrir
io-r"srrrpiusi variai:ie f.ar er:te;:ing, sliould be seleeted" {
a) Slael.,:raria.bls '_.- $'
bI Surpi-rts variabjs
' I i'iri!" "::: ".:'''li.:^ :J
'E 1..,,,," -,',,i," rl;U , t LfBftAftY

I
xiv)
) prob
*
has to be
a)1
c)m d) none of the above

xv)
Method
c Coritro I Path Management d) CriticalP{fir Management
|-.'ii
1."., 1

xvi) The minirnin criterion is used when conseq ue.ne,es are given in the fonn
0f''"
a) Probabilities Table
c) Opportunity loss ff
xvii) Each player should skategy regardless of the other
player's strategy in w garnes?
a) Constant b) Mixed strategy
c) Pure strategy d) Dominance strategy
f\;
,i

xviii)ln Markor. analysis, qtplb pro babilities must

L a) Sum to one .,'.,1':' b) Be less than
c) Be greater than one d) None of

*i^) are the entities whose values are from the

solution of the LPP.
--
a) Objective function b) les
c) Constraints d) costs

xx) The longest path in the network 1S sa-lled path

a) best b) *frtrst
j! t

c) sub-critical d),'..:"'britical

[s86s] - 20s 3
 "z*; {.) Soive the fullcwing LPP Isj
I\rtraximize Z = -2xt ,.,;
- x,. "]

Sub.lect la

* \+ x2- x3 >5
x, -2x, + 4
X1, X2, X7

b) the given pay-off rnatrix 1,',"'?

i-r I

7" A'J .^ 1-.;:

20

J 4 6
,"^- . t_
-4 I
0 5

a) Solve the following LPP t6j

Maximize Z =3xt *
Subject to
'/1
flk r
t;::*.
\.'';-
\"
xr+xr14 i"*I' ilL"
f*.l'
x,-xr32 *- 1;"

xt, x2>0

b) The following is the pay-off rnatrix of a game byAandE

Determine the optimal strategies for player
I4l
B's strategy

B2

As strategy Ar 9 -6 i
d)*
*L,
u

ru'
-5 5 ,l

[s86sl - 20s 4
 fiJ a) 'l'he foil elwiflg rnfbrmation
regardift g a i.ai"ojeet is 6rvwu
!.ul
Tirae in ela17s
4
l{efil/iry i,.:.,',=....
i;liil:LLli-i[i
,i..:..
M*st h,f*st
Fre eicce ssor ., * .,-*j
5ri iitiiilu ^ LIBRARY
A 4 6 8
'{
B 5 7 0.
15 *
C 4 8 12
D I5 20 25
E 10 1B 26
F B 9 t6
E 4 I 12
DF I 2 I
1

I G,H 6 7 8

1) Constn-rct
ii) Determine path the expected completion
time.
iii) Determine the project in 55 days.

b) Considerthe along with given probabilities of each

state
I6I
S .",,. )

L
N $ lities
NI,
-l
ft\.
. \'"1i"

tu.
Strategies 0.3 0.6 i*,*!&
0.1
SI 20 18
S2 25 15 I
S. 40 -10 1

Calculate
l) EMV
ii) EVPr
iii) vPr #,,"",

OR
[s86sl - 20s 5
 a) F*r the dat a givec ir ti:e tabie brj*rn,, ilrav,, ihe *e t.,;.c; i;, ;1"::.,;.i::
svsietniriieai i-r, tiie itetivities anii eleteru:ir:e tire optirnai prcjeet
rj iria;i ,;.i':
{ iinct ccst.
Timeiweei<) L_ OS i iir Rs. {tl*{] }

LIBNAfrY r \L ti v al
ti -.1,i
llr
IlvlriiurY
i r-r rr-^
\- rl5l-1-
I ._,.^^i..
r-. .L r
i. r15 r i
&* 1/'t
c..
l-z L
t
I ln
I\_' l5
a:-
1
1-3 Q :.+,
1a * s"-, 15 21
..,t . .,:
.a,,J
2-4 ;. t|': :: r,.
20 24
3-4 1,. .):',o 1 7 7
3-5 ##2 ,.'-:,,. 1 8 15
4-6 : nF 5.1",.:,
a
10 16
J-() ' 1 ()r- 2 t2 36

e pro3ect neti,vork.
D i"l.t",-
the critical path & the no'nal adion and associatec
i$.o st.
iii)'liCrash the acti vities so that the
etion time reduces to
'i:'. 9r,veeks,tvith minimun addi

b) A manufacturer of cycle has following distribution ot.

demand for a articular
Demand ,,4 t6j
0 1 A5* Jn 5 6
Probability 0.14 0.27 fl::y? o-tvfo.oo 0.04 0.01

Q4 a)

Item Ai Bi Ci
1 4 4 6
2 9 5 9
a
J 8 3 11
4 6 2 B
"l
5 J 6 7

1) Find the sequence that minimizes tot"dl elapsed time.

ii) Find the idle times for all the

[s86sl - zas 6
 b') The nuinber of units af an item that;rre rvithrJra'\vtl fiom the inventofy s1i
a ilay to elay basis is a Markov cirain proeess in wliieh the reqriirements
for tcl:r*;-r:ov, rlep*cri cil t+da.v'S .,1*ip.1.-1..1p1r-'-'::..' -A c::: *a;.3ansit+t r*.=ir.,z
::.t .,:. -..:"-:....
5i'";li uf,iu''.. :-. i

Trli:norrov,-. ' d
:a, t

,,5r,-l: l0 1.,I2 o
;o
5 0.0 LIBBARY
],+
Toda, 0.4 I
,.,,,,,.].,
' *
i,r4
, ,l,:4/
0.3 0.6
,]i;ttioo..:, :

a two day transition matrix.

( ii) toa

OR

a) Seven Jobs are to be machines A and B. Processing

times (in hours) are t6l
.j\

Jobs 1 2&, 4,"'::;'"" 5 6 7

.#q ;i
MachineA: t0 -is l8 2A 14
L;
q0'
Machine B: L2 o 7''','.,"- t2 10 6 13

i i-.-.

(_ Find the elapsed tim'#ild idle times tbr machnies A and B

b) The present market shares of three brands of 3A%

and l0o/o respectively. The transition follorvs:
I4l
0.7 0.2 0.1
P 0.2 0.6 0.2 .; 'i,"

0.1 0.1 0.8

l) Find their expected market shares affi two years.
:''
i, Find their long-tenn marhet share-ei
\,
[s86sl - 2a5 7
 .;

$S; e"'; F.ailrfali distribLrti+n in;nonsc,;ft seascn as ii:ilci',,s:

Rain in cm ri I .t- -J
a /1 {
Prnhrhilit',
r i vuq!, li,t tJ. 1{,
\: ./ " n
I t ft /l{ r} n? ri fi') ._)

Sii*,ulate the :.:.-..l,rrr-- ...r1,

{-*1 L1 ',)il {c
\) /, t).f, i, e J_t) -.-, .....!:...11
l.tilildttr

b) Explainthe with example. 14]

,
ii) solution in LPP

OR
a) s stock o l'a popular brand of cake. P,revious experience
daily demancl pattem for the itern rvith as,Soiiatedprobabilities,
'!-'
AS belor,v: I4I
Dqly dernand 0 10 20 3Q,,* _f50
t"
(number)
.:
Probabilitv 0.01 0.2a 0.19.
'8.50
J 0.02

Use the follorning nurnbers to simulate the demand

for next 10 clays.
Random numbers : 19,49
Also estimate the a\i6tage demand for
simulated data. i;"".'
,.i*'
",'4,;
b) Explain the followin[ terms with examples:
1) Dummy activity
ii) Optimistic tirre

LIgRARY N.'
'--J N.'
\)
-{
t :. +

[s86sl - 20s 8