14694 14694 14694 14694 14694 14694 14694 14694 14694

14694 Roll No.

14694 14694 14694 14694 14694 Total14694
No. of Pages
14694 : 03 14694

Total No. of Questions : 09

MCA (2012 & Onwards) (Sem.–3)
14694 14694 14694 14694 14694 14694 14694 14694 14694
COMPUTER BASED OPTIMIZATION TECHNIQUES
Subject Code : MCA-302
Paper ID : [B1158]
14694 14694 14694 14694 14694 14694 14694 14694 14694
Time : 3 Hrs. Max. Marks : 100

INSTRUCTION TO CANDIDATES :

m
14694 14694
1. 14694
SECTIONS-A, B, C &14694
D contains 14694
T WO questions14694 each carrying
14694 T WENT14694
Y marks 14694

each and students has to attempt any ONE question from each SECT ION.
2.

o
SECTION-E is COMPULSORY consisting of T EN questions carrying T WENT Y

.r c
marks in all.
14694 14694
3. Use of 14694 14694
non-programmable 14694
scientific calculator 14694
is allowed. 14694 14694 14694

14694 14694
1)
14694

pe
14694
SECTION-A
14694
Consider the following linear program (LP) :
14694

o m
14694 14694 14694

Minimize Z = 3x1 + 2x2

p a .r c
r
Subject14694
to

e
14694 14694 14694 14694 14694 14694 14694 14694

b p
x1 + 2x2 < 12
2x1 + 3x2 = 12
14694 14694
2x114694
+ x2 > 8 14694 14694

a
14694 14694 14694 14694

14694 14694
and x1  0,

a) Plot14694
x2 > 0

the feasible region

14694

b
14694 rp14694

b) Determine all corner point feasible (CPF) solutions.

14694 14694 14694

c) Determine all basic feasible (BF) solutions.

14694 14694 14694 14694 14694 14694 14694 14694 14694
d) Determine all optimal solutions.
e) If Constraint (1) changed from x1 + 2x2 < 12 to x1 + 2x2 > 12, what is the optimal
14694 14694
solution?
14694 14694 14694 14694 14694
(5×4=20)
14694 14694

2) Find the dual of the following primal linear programming problem and solve the primal
from the solution of the dual problem:
14694 14694 Minimize
14694Z = 3x1 + 2x 2 + x4
14694 14694 14694 14694 14694 14694

Subject to
2x1 + x2 + x3 + 2x4 > 7
14694 14694
x2 +14694
3x4 = 5 14694 14694 14694 14694 14694 14694

x1 , x2 > 0, x3  0 , x4 unrestricted. (20)

14694 1| M
14694 - 7 0 7 714694
3 14694 14694 14694 14694 ( S 1 4 14694
)-2001 14694

14694 14694 14694 14694 14694 14694 14694 14694 14694

14694 14694 14694 14694 14694 14694 14694 14694 14694

SECTION-B
14694 14694 14694 14694 14694 14694 14694 14694 14694

3) Consider the transportation problem having the following parameter table :

14694 14694 14694 14694 Destination14694

14694 14694 14694 14694

1 2 3 Supply
Source 1 13 16 15 18
Source 2 18 15 16 14
14694 14694 14694 14694 14694 14694 14694 14694 14694
Demand 10 5 10

a) Use the Northwest corner rule to obtain an initial basic feasible solution and objective

m
14694 14694 function
14694 value. 14694 14694 14694 14694 14694 (10) 14694

o
b) Use the transportation simplex method to find an optimal solution. Identify the

.r c
optimal solution and the objective function value. (10)
14694 14694 14694 14694 14694 14694 14694 14694 14694

4) Consider the problem of assigning four operators to four machines. The assignment costs

14694 14694 cannot 14694

be assigned to

pe
machine 4. 14694
14694 Find the optimal
14694 assignment m
in Rupees are given below. Operator 1 cannot be assigned to machine 3 and operator 3

o
using the ‘Hungarian
14694 14694 14694

.r c
Assignment Method’.

p a Machine

r e
14694 14694 14694 14694 14694 14694 14694 14694 14694
1 2 3 4

14694 14694
b
Operator
14694
1
2
3 14694
5
7
9 14694
5
4
3
a p
-
2
146945
2
3
-
14694 14694 14694

rp
4 7 2 6 7
(20)

14694 14694 14694 14694

b
14694

SECTION-C
14694 14694 14694 14694

14694 5)
14694 What is dynamic programming?
14694 14694 Differentiate
14694 between
14694 deterministic
14694 and probabilistic
14694 14694

dynamic programming. Give applications of dynamic programming? (20)

14694
6)
14694
a) Let14694
A and B be events defined
14694 14694
on some14694sample space,
14694
with P(A) = 1/3,
14694 14694
P(B) = 1/4, and P(A B) = l/6. Find the probability that exactly one of the events
A, B occur. (10)

14694 14694 b) Among

14694 35 students in a class, 1714694
14694 earned “A” on the midterm,14694
14694 14 earned “A” on final
14694 14694

exam, and 11 did not earn “A” on either exam. What is the probability that a
randomly selected student from this class earned “A” on both exams? (10)
14694 14694 14694 14694 14694 14694 14694 14694 14694

14694 2| M
14694 - 7 0 7 714694
3 14694 14694 14694 14694 ( S 1 4 14694
)-2001 14694

14694 14694 14694 14694 14694 14694 14694 14694 14694

14694 14694 14694 14694 14694 14694 14694 14694 14694

SECTION-D
14694 14694 14694 14694 14694 14694 14694 14694 14694

7) Solve the following LPP by the Gomory algorithm :

Maximize Z = 20x1 + 22x2 + 18x3
14694 14694 14694 14694 14694 14694 14694 14694 14694
Subject to the constraints

4x1 + 6x2 + x3 > 54

14694 14694 14694 14694 14694 14694 14694 14694 14694
4x1 + 4x2 + 6x3 > 65
x1 , x2 , x3 > 0 , each < 7 and integers.

m
14694 14694 14694 14694 14694 14694 14694 14694 14694
8) Solve the following integer LPP using branch-and-bound algorithm :
Maximize Z = 2x1 + 10x2 + x3
o
.r c
14694 14694
Subject14694
to constraints14694
: 14694 14694 14694 14694 14694

14694 14694
5x1 + 2x2 + x3 < 15
2x114694 14694
+ x2 + 7x3 < 20
pe 14694 14694

o m
14694 14694 14694

x1 + 3x2 + 2x3 < 25

p a .r c
r
x1 , 14694
x2 , x3 > 0 , and14694
integers.

e
14694 14694 14694 14694 14694 14694 14694

14694 14694
b
14694 14694 SECTION-E
14694

a p
14694 14694 14694 14694

14694
9)

14694
Write briefly :
a) Explain
14694
the main characteristic
14694

b) Name various OR models.

14694

b
features rp
of Operations
14694
Research.
14694 14694 14694

c) What is linear programming? What are its major assumptions?

14694 14694 14694 14694 14694 14694 14694 14694 14694

d) What is meant by degeneracy in a linear programming problem?

e) Explain how the assignment problem can be treated as a particular case of
14694 14694 14694 14694 14694 14694 14694 14694 14694
transportation problem.
f) Explain the Role of Sensitivity Analysis in decision making.
14694 14694 g) Discuss
14694 the economic
14694 interpretation
14694 of Dual Variables.
14694 14694 14694 14694

h) What is unbalanced transportation problem? Explain.

14694 14694 i) What is decision theory?
14694 14694 14694 14694 14694 14694 14694

j) Give definition of probability.

14694 3| M
14694 - 7 0 7 714694
3 14694 14694 14694 14694 ( S 1 4 14694
)-2001 14694

14694 14694 14694 14694 14694 14694 14694 14694 14694