17886 17886 17886 17886 17886 17886 17886 17886 17886

17886 Roll No.

17886 17886 17886 17886 17886 Total17886
No. of Pages
17886 : 03 17886

Total No. of Questions : 07

B.Com. (2011 & Onward) (Sem.–3)
17886 17886 17886 OPERATION
17886 17886 RESEARCH
17886 17886 17886 17886

Subject Code : BCOP-304

Paper ID : [B1127]
17886 Time : 3 Hrs.
17886 17886 17886 17886 17886 Max. Marks
17886 17886 : 60 17886

INSTRUCTIONS TO CANDIDATES :
1. SECTION-A is COMPULSORY consisting of TEN questions carrying T WO marks
17886 17886
each. 17886 17886 17886 17886 17886 17886 17886

2. SECTION-B contains SIX questions carrying TEN marks each and students have
to attempt any FOUR questions.

17886 17886 17886 17886 17886 17886 17886 17886 17886

SECTION–A

17886
1.
17886
Write briefly :
17886 17886 17886

o m 17886 17886
a) Is the set S = {( x1, x2 ) : 0  x12  x22  4 } convex? Justify your answer.
17886 17886

17886 17886 to an
17886 17886 problem?
17886
.r c
b) What is the necessary and sufficient condition for the existence of a feasible solution
m × n transportation 17886 17886

m
17886 17886

c) Find all basic solutions for the system

p e o
.r c
x1  2 x2  6
17886 17886 17886
3 x1 – x2  7 ;
a
17886
x1, x2  0

p
17886 17886 17886 17886 17886

17886 17886 “unbounded

17886
r
solution”.
17886

e) Explain the following terms.

17886 17886 17886

p e
d) While solving an LPP, maximize Z = CX, s.t. AX = b, X  0, b 0, what indicates

b 17886 17886

a
rp
(i) Total float
17886 17886 17886 17886 17886 17886 17886 17886 17886
(ii) Independent float.

17886 17886 g) Explain

17886 the four elements
17886 that characterize
17886 b
f) Explain the meaning of ‘Crashing’ in network techniques.
sequencing
17886

h) Prove that the dual of the given primal, is the primal.

problem.
17886 17886 17886

i) Write the dual of

17886 17886 17886 17886 17886 17886 17886 17886 17886
Minimize Z = 4x1 – 8x2
s.t. 2x1 + 6x2 = 3
17886 17886 17886
x1 +17886
4x2 6; x1, 17886 17886
x2 – unrestricted. 17886 17886 17886

j) Write three major limitations of Operation Research.

17886 1 | M-22016
17886 17886 17886 17886 17886 17886 17886(S3)-86 17886

17886 17886 17886 17886 17886 17886 17886 17886 17886

17886 17886 17886 17886 17886 17886 17886 17886 17886

SECTION–B
17886 17886 17886 17886 17886 17886 17886 17886 17886

2. Solve the following problem using two-phase method :

17886 17886 Minimize

17886 + x2 – 2x3
Z = 3x117886 17886 17886 17886 17886 17886

s.t. 4x1 + 2x2 – x3 1

17886 17886 17886 17886 17886 17886 17886 17886 17886
x1 + x2 + x3 5

2x2 + 4x3 = 3; x1, x2, x3 0

17886 17886 17886 17886 17886 17886 17886 17886 17886

3. Write the dual of given primal problem. Solve the dual problem using simplex methods
and then write the solution of primal problem.
17886 17886 17886 17886 17886 17886 17886 17886 17886
Maximize Z = 8x1 + x2

17886 17886 17886

s.t. 8x1 + x2 8
17886

2x1 + x2 6
17886

o m 17886 17886 17886 17886

17886 17886 17886 1 + x2 6

3x17886 17886
.r c 17886 17886

m
17886 17886

e
x1 + 6x2 ; x1, x2, 0

p o
a .r c
17886 17886
4. Reduce17886
the following17886 17886
game by dominance property17886
and solve it : 17886 17886 17886

1
r 2
p 3 4 5

e
17886 17886 I
17886

II
1
3 b 2
17886

4
7
1
3
17886

6
4
5
17886

a p
17886 17886 17886

rp
III 5 6 7 5 6
17886 17886 17886 17886 17886 17886 17886 17886 17886
IV 0 2 1 3 2

17886
5.
17886 17886

D1
17886

D2 D3
17886 b
Solve the following transportation problem to get an optimum solution :

D4 Available
17886 17886 17886 17886

O1 2 3 1 2 40
17886 17886 O2
17886 5 4
17886 2 6
17886 60 17886 17886 17886 17886

O3 3 9 7 2 80
Demand 10 40 60 20
17886 17886 17886 17886 17886 17886 17886 17886 17886

17886 2 | M-22016
17886 17886 17886 17886 17886 17886 17886(S3)-86 17886

17886 17886 17886 17886 17886 17886 17886 17886 17886

17886 17886 17886 17886 17886 17886 17886 17886 17886

6. A small workshop undertaking repair of damaged cars has one denter and one painter.
17886 17886 17886 17886 17886 17886
Presently there are 6 cars needing repair. The following estimates17886 17886
in hours of time needed 17886

for denting and painting on the cars are available.

17886 17886 Car17886 – 1

17886 2 3
17886 4 5
17886 6 17886 17886 17886

Denting time – 4 7 3 12 11 9
Painting time – 11 7 10 8 10 13
17886 17886 17886 17886 17886 17886 17886 17886 17886

What is the sequence that completes all the jobs in minimum time? What is the
corresponding schedule of jobs?
17886 17886 17886 17886 17886 17886 17886 17886 17886
7. Consider the network given in following data :

Activity – A B C D E F G H I J
17886 17886 17886 17886 17886 17886 17886 17886 17886
Immediate
– – A A A B C,D D B E,F,G G
Predecessor

17886 17886
Activity
Duration
17886(days)
–17886 2 317886 4

o m 5 17886 6 3 17886
4 7 17886
2 3 17886

17886 17886
(i) Draw the network
17886 17886 17886
.r c 17886 17886

m
17886 17886

e
(ii) Find critical path

p
(iii) Find free floats and Total floats of each activity.
o
a .r c
17886 17886 17886 17886 17886 17886 17886 17886 17886

r p e
17886 17886 17886

b 17886 17886

a
17886

p
17886 17886 17886

rp
17886 17886 17886 17886 17886 17886 17886 17886 17886

17886 17886 17886 17886 17886 b 17886 17886 17886 17886

17886 17886 17886 17886 17886 17886 17886 17886 17886

17886 17886 17886 17886 17886 17886 17886 17886 17886

17886 3 | M-22016
17886 17886 17886 17886 17886 17886 17886(S3)-86 17886

17886 17886 17886 17886 17886 17886 17886 17886 17886