Total No.

of Questios: 3 SEAT No. 38s1

PS146 [Total No. of Pages: 4

S.Y.
I5823404
B.Sc. (Computer Science)

MATAEMATICS
MT42 Operations Research
(2019 Patte) (Semester - IV) (Paper - I1) (24222)

Time: 2 Hour IMax. Marks: 35

Instrwctions o Ne
canddates:
I) ArQucations are
compulsory:
2)
Figurc to
right indicates full marks
the

S)
rogrammable sciennific calcuator is allown

Q) Atempt any Five of the following. [5 x 2 =

10
a)Write two applications of Ligea prográmming problem.
H o w an assugnment problepa vith
çertain restrictions can be solved?
)Wrnte dual form of the
talowing Linear programming problem
Maximize 7Z= , Y
Subject to
3x, + 21, s 6

3x, +X, 4

20
Obtain Initial Basic Feasible solution of the
TranDorlation Problem
using Matrix Minima Method.

Destination
P D, Supp
Origin
o, 13 10

0,
Demand

RTTO.
 Solve the lollowing Assignment
rTODiem
lor minimization:
I
JoDs

Persons

WWrite ttestamard lorm of the tolowing linear programming problei

finittize 7.= x, +\,+ X
Subject to
A-31, + 4, = 5

21,s3
-x,24
co:1U8
A,20
D r a w the Feasible region f o r tolowing constraints
Max
Z=Sx -
Subject

2+ 2y 2

Q2) Auempl any three of the 1ollowing :

y 5 15]
Sole the tollowIng assugnment problem to mutuize the cost such
hat Miuchine. M, cannot oe assigneu Jo* n e M, cannot
be assigned J o b - A.

B C D
M 9 15 10 H
10
14
M, 14 8 12 7 '8
DSolve the following Lincar Progranming Problem by Big-M mecno
Maximize Z= *a,
-A,
Subject to

. , . .

Solve tic olgwing assignment problem For minimum cOst

BC D E
M 7 9 8 11
7 1110

M, 7

M,4 6
S o l v e the Linear Progruminig ProbBem by graphically.
Max. Z = *+ 13y
Subject to :

2r+3y18
2x+ys 16
2
Solve Transportation Problem by north west cores rule

IIIVV pacity
9

8 4
D 3 5 7 10N 9
E 8 10 4
Requiremnent 7 6 4

58231-404
 [1x 10 = 10]
Q3) Attepi any onc
of the following:
solution by vogel's Approximation
method.
Feasible
a)
ind Initial Basic solution byModified
Distribution method
ot the

Obtain the optimal

TOlowing transportation proafom.
Ware houses
Supply
Factory
$0
19
3 0 O 9

40 20
14 34
Requirement

the following Linear Programming problem by simplex

Y Solve
mothod.
Max. Z = 6x + 3y

Subject to
APOI169108202
2+yg8
3x+3y 18

ys3
X. y20

APOIT691
W r i t e an algornhm tosolve assignment problem

2208:11:
08.20.