-\&

)..^uJ
fl{:ii**q}h SItA'l'xo.:l-----l
S[ (&*. \ti
Total No. of Questions : 6l ;- r' \'6

P4856
w''i# [Total No. of Pages : 5

Is3ssl-737
M.E. (Information Technology)
.i INFORMATION TECHNOLOGY ORIENTEI)
OPERATION RESEARCH

rMax' Marks : 5o
i',f;;:,f::::,,,, ,no,tij,tot,,,
1) Attentpt any one of Ql or Q2, rest all questions compulsory.
2) Assume Suitable duta, if necessary.
3) Neat diagram ntust be drnwn wherever necessury.
4) Figures to the right indicate full marks.

Ql ) a) Solve using Simplex Method: 171

Marinrize l:2x,1 3x, * x., * 7x+
Sub.iect to: Bx, 1- 3x, + 4x. * xu ( 6
2x, 'l- 6x, f x.. -1-
-5xr 5 l
X, * 4x, 1 5x: * Zxt< 7

X,, X,, x,, x* ) 0

b) Write short note on "Derirring the solr-rtion fi'om the rnoclel". t3l
OR
#.2) a) Solve the follow'ing using dual simplex rnethod: 17l
Minirnize Z: x,1- x,
Sr-rb.iect to: 2x, * x, ) 4
x,l 7xr) J
xt,x,>0
b) Construct the dr-ral of the given l-inear Prograntmirrg Problerrr: t3l
Maximize 7, : 4x, + 5x,* 2x., 1

Strb.icct to: l^, - x. + x. S 4

lx -1r-"1 *x''1 = []
X,, Xr, ) 0
',
PT.O.
Q3) Attempt anl,two:
a) Consicler the problem of assigning -5 operatols to 5 urachines. The
assigrunent cost are as given in table belou,: tsl
ml m? rn3 nt4 m5
'7
A 7 4 8

B 9 6 4 5 6

C 11 5 1 5

D 9 4 8 9 4

F] 8 7 I 11 3

Operator A cannot be assigned to machine m3 and operator C cannot be

assigned to rnachine m4. Find tlie optirlal assignment schedr-rle.

b) Detertrine the initial basic leasibie soh-ition for the given transpoltatior-r
nratrix usirrg: tsl
i) North-West Conrer I{r-rle

ii) VogelsApploxirnatior-rMethod

12345SLrpply
f
A 1 11 10 -) 7 4

B 1 4 7 2 i 8

a
C J 9 4 8 t2 9

Dernancl 3 3 4 5 6

c) Detennine the optinral (Minirnum) schedule for the given tlansportation

rratrix: tsl
ABC SLrpply

I l3 3I 8 20 200

2 14 9 ll 6 10 175

-) 25 1l l2 t7 t5 1-50

4 10 2t 13 17 325

Demand 110 90 120 230 160

ls3ss)-737 )
a

Q4) Attetnpt anytwo:

a) Mr. Xhas Rs. 10,000 to invest in one of tl'rree options: A, B, ol C. The
return of his iuvestnrent depencls on whetl-rel the econotny experiences
lnflation. Recession or No Change at all. The possible returns under
each economic below:
econontic condition are given below: I5l
State of Nature
Str"ategy
Inflation l{ecession No Change
A 2000 1200 1 500

B 3000 800 1000

C 2500 1000 1 800

What should he de cicle r"rsing Pessimistic Criter ion, Optirnistic Criterior-r,

Equally l-il<ely Criterion ar-rcl Itegret Criterion?
b) Explain "Expccted ValLre of Perfect infblrnation (EVPI)" with example.
tsl
c) Solr,e the following game using Maximir-r (Minimax) plinciple, rvhose
pay nratrix are given below: include ir"r your answer: l5l
i) Strategy selection of each piayer,
ii) J'he value of the game to each player. Does the game havc sadclle
point?
PlayerB
PlaycrA
B1 B2 B3 B4
Ai 1 7 3 4

A2 5 6 4 5
a
A3 7 2 0 J

Q5) Attetnpt any tu,o:

a) " Def ine the following Dynantic Pro,{ramnrit-ig ternts: tsl
i) Stage

ii) State Variable

iir) Decision Valiable

i,r) lmmediate Return
v) Optimal Returu

Is3ssl-737 3
 b) A str-rdent has to take an exanrination in 3 collrses x, y and z. Ile has 3
days for stud1,'ing. I le feels that it would be better to devote a whole day
te study one single course. So he rlay study a collrse of one day, 2 days
or 3 da1,s or not at all. His estimates of'grades he may get according to
days of study he puts in are as follows: tsl
S tu ct v Llourse

Days v Z

0 1 2 1

1 2 2 )
2 2 4 4

J 4 5 4

How many days shoLrld he allocate to each col]rse so that he gets the
best result?

c) Consider the problem of designirrg an electronic device that consists of-

3 urain cor1lpor1el1ts. The components are arranged in ser:ies so that the
failure of one of them will resr-rlt in the failure of the whole device.
Therefore, it is decided that the reliability (probability of failtrre) of the
device shor-rld be increased by installing palallel r-rnits on each component.
Each colnponellt may be installed ir-r, :rt the most, 3 parallei units. The
total capital (irr thor-rsancls Rs.) availaLrle lbr the device is 10. The fbllou,ing
data is available: tsl
Corrponents
1
Number of I 2 -l

Parallel Units rr I
R1 cr R, c2 R3 c3

1 0.5 2 0.7 )a 0.6 i

2 0.7 4. 0.8 5 0.8 2
1
3 0.9 5 0.9 6 0.9 -l

rvhere R and Cli (i : 1. 2, 3) is the reliability arrd the cost of the ith
colxpoltent, respectively. Determine the nutnber of parallel units that will
rnaximize the total reliability of the system withor-rt exceeding the given
capital.

l53ssl-737 4
Q6) Attempt any two :

a) Draw the netrvork cliagr:am from the follou,ing list of activities: tsl
Activity Predecessor Activity
A
B A
C A
D C
F, B,C
F' D,E
G E
H G
I D,F
J I,H
K J

b) For the follorving set ol'activities, tlie tirne required to contplete the
activity is given. tsl
Activity Time in Days Preclecessor Activity
A 5

B l A
C 2 B
D J B
E, 1 C
F 2 D
G 1 C
H -) E,, F

t0 G,H
a1

I
" i) What is the minimum completiotr tin-re f,or the proiect.
ii) Find thc total lloat and fi'ec float (if an1,) lol all tiie non-critical
activities.
c) What is F orecasting Model? I)iscuss sorre appiications of the F orecasting
Model. I5I

sss
[s3ss1-737