Total No. of Questions : 3] SEAT No.

:
PA-1020

38
[Total No. of Pages : 4

ic-
tat
[5902]-44

2s
S.Y. B.Sc. (Computer Science)

9:3
30 1
1
MATHEMATICS

9:3
1/2 02
MTC - 242 : Operations Research
1
02
(2019 Pattern) (Semester - IV) (Paper - II) (24222)
8 1 P0
A

Time : 2 Hours] [Max. Marks : 35

4/0
8.7 CA

Instructions to the candidates :

1) All questions are compulsory.

38
7.3

ic-
2) Figures to the right indicates full marks.

tat
3) Non-programmable scientific calculator is allowed.

2s
.24

9:3
Q1) Attempt any Five of the following : [5 × 2 = 10]
49

11
9:3
a) Use north-west corner rule to obtain Initial Basic Feasible Solution of the
02
30

following transportation problem :

01
02

Destination D1 D2 D3 Supply

1/2
AP

Origin 
4/0
CA

    
81

38
7.3

    
-
tic
8.7

    
sta
.24

:32

Demand 9 10 11
49

11
:39
02

b) Write dual form of the following Linear Programming Problem :

09
23
1

Minimize Z = 10 x1 + 6x2 + 2x3

8 1 P0
/20

Subject to :
01
A

– x1 + x2 + x3  1
4/
CA

3x1 + x2 – x3  2
7.3

x1, x2, x3  0
8.7
.24

P.T.O.
49
 c) Solve following assignment problem for Maximization :
Jobs 

38
I II III
Persons 

ic-
   

tat
   

2s
9:3
C 3 1 2

30 1
1
d) What is degeneracy in the transportation problem?

9:3
1/2 02
e) Write the mathematical formulation of assignment problem.
1
02
f) Write the standard form of following Linear Programming Problem :
8 1 P0

Minimize Z = x1 + x2 + x3
A
4/0

Subject to :
8.7 CA

38
x1 – 3x2 + 4x3 = 5
7.3

ic-
x1 – 2x2  3

tat
2x1 – x3  4

2s
.24

x1, x2, x3  0
9:3
49

11
9:3
g) Draw the feasible region for the following constraints :
02
30

Maximize Z = 3x + 2y
01
02

Subject to :
1/2
AP

x– y  1
4/0
CA

x+y3
81

38
x, y  0
7.3

-
tic
8.7

sta
Q2) Attempt any three of the following : [3 × 5 = 15]
.24

:32

a) Obtain Initial Basic Feasible Solution of the following transportation

49

11
:39

problem by Vogel's approximation method.

02
09

Warehouses W1 W2 W3 W4 Supply

23
1

Factory 
8 1 P0
/20

    
01
A

F
4/
CA

F     
F     
7.3
8.7

Requirement 90 160 200 50

.24
49

[5902]-44 2
 b) Solve the following assignment problem :

38
A B C D E

ic-
M1 4 6 10 5 6

tat
2s
M2 7 4 - 5 4

9:3
30 1
M3 - 6 9 6 2

1
9:3
1/2 02
M4 9 3 7 2 3
1
02
c) Solve the following linear programming problem by graphically :
8 1 P0

Maximize Z = 3x + 5y
A
4/0
8.7 CA

Subject to :

38
x + 2y  2000
7.3

ic-
x + y  1500

tat
2s
.24

y  600
9:3
49

11
x, y  0
9:3
02

d) Solve the following Linear Programming Problem by Big-M method.

30
01
02

Maximize Z = x + 4y
1/2
AP

S.t.
4/0
CA

x + 2y  2
81

38
4x + 3y  12
7.3

-
tic
8.7

x, y  0
sta
.24

:32

e) Solve following assignment problem for minimum cost :

49

11
:39

I II III IV V
02
09

1 3 8 2 10 3
23
1
8 1 P0

2 8 7 2 9 7
/20
01
A

3 6 4 2 7 5
4/
CA

4 8 4 2 3 5
7.3

5 9 10 6 9 10
8.7
.24
49

[5902]-44 3
Q3) Attempt any one of the following : [1 × 10 = 10]

38
a) Obtain optimal solution of the following Transportation Problem by

ic-
modified distribution method.

tat
2s
1 2 1 4

9:3
30 1
20 10

1
9:3
1/2 02
3 3 2 1
1
02
8 1 P0
20 20 10
A

4 2 5 9
4/0
8.7 CA

20

38
7.3

ic-
Also obtain alternate optimal solution

tat
b) Solve the following linear programming problem by simplex method :

2s
.24

9:3
49

Maximize Z = 3x1 + 2x2 + 5x3

11
9:3
02

Subject to :
30

x1 + 2x2 + x3  430
01
02
1/2
AP

3x1 + 2x3  460

4/0

x1 + 4x2  420
CA
81

38
x1, x2, x3  0
7.3

-
tic
8.7

sta


.24

:32
49

11
:39
02
09
23
1
8 1 P0
/20
01
A
4/
CA
7.3
8.7
.24
49

[5902]-44 4