VI/BCA/602 Student's Copy
2 0 1 8
6th Semester
BACHELOR OF COMPUTER APPLICATIONS
Paper No. BCA-602
Operation Research
Old Course
Full Marks 75
Time 3 hours
PART A—OBJECTIVE
Marks 25
The figures in the margin indicate full marks for the questions
SECTION—A
Marks 15
1. Tick the correct answer in the brackets provided 1×10=10
Who coined the term 'operations research'
J. F. McCloskey
F. N. Trefethen
Both and
P. F. Adams
Operations Research which is a very powerful tool for
research
decision making
operations
All of the above
/568 1 Contd.
OR cannot give perfect to a problem.
answer
decision
solution
Both and
Which technique is used in finding a solution for optimizing a given
objective under some constraints?
Linear programming
Queuing theory
Waiting line
All of the above
Which theory concerns making sound decisions under the conditions
of certainty, risk and uncertainty?
Game theory
Queuing theory
Network analysis
All of the above
Which technique is used to imitate an operation prior to actual
performance?
Simulation
Decision theory
Game theory
Inventory control
In model, there is risk and uncertainty.
deterministic probabilistic
Both and All of the above
For solving an assignment problem, which method is used?
Hungarian
American
Both and
All of the above
VI/BCA/602 2 Contd.
If demand is lesser than supply, then dummy demand node is added
to make it a
simple problem
balanced problem
transportation problem
All of the above
One can find the initial basic feasible solution by using
VAM
MODI
optimality test
All of the above
2. State whether the following statements are True or False by putting
a Tick mark in the brackets provided 1×5=5
Dual of the dual is a primal. T F
Slack variables are added in the LHS of the constraint to convert the
inequality into an equation. T F
VAM stands for Vogeal's approximation method. T F
In simplex method, we add artificial variables when no initial basic
feasible solution exists. T F
If the feasible region of an LPP is empty, the solution is feasible.
T F
SECTION—B
Marks 10
Answer the following questions 2×5=10
1. Define optimality and feasibility condition.
2. What are slack and surplus variables?
3. What is the way to balance a transportation model?
4. Define linear programming.
5. Define critical path.
VI/BCA/602 3 Contd.
PART B—DESCRIPTIVE
Marks 50
The figures in the margin indicate full marks for the questions
1. Explain the scope of OR in modern management. 5
Explain the phases of implementing OR. 5
OR
Explain OR techniques. 5
Write the applications of OR. 5
2. Explain the major characteristics of linear programming problem. 2
Solve the following by graphical method 8
Maximize Z 5x1 4x2
subject to
6 4 24
2 6
1
2
0
1 2
1 2
1 2
2
1 2
x x
x x
x x
x
x x
£
£
£
£
³
OR
Solve the following by simplex method 10
Maximize Z =16x1 +15x2
subject to
40 31 124
1
3
0
1 2
1 2
1
1 2
x x
x x
x
x x
£
£
£
³
VI/BCA/602 4 Contd.
3. Solve the following assignment model 5
Jack Jill Johnny
Washing 15 10 9
Cleaning 9 15 10
Panting 10 12 8
Explain the steps involve in critical path problem. 5
OR
Solve the following transportation problem 10
Supply
10 2 20 11 15
12 7 9 20 25
4 14 16 18 10
Demand 5 15 15 15
4. Solve the following by dual simplex method 10
Maximize Z 3x1 2x2 x3
subject to
3 3
3 3 6
3
0
1 2 3
1 2 3
1 2 3
1 2 3
x x x
x x x
x x x
x x x
³
³
£
³
OR
Describe the similarities and differences of CPM and PERT
constructions of network. 5
Write the dual for the following primal 5
Maximize Z 5x1 +12x2 4x3
subject to
x x x
x x x
x x x
1 2 3
1 2 3
1 2 3
2 10
2 3 8
0
£

³
VI/BCA/602 5 Contd.
5. Find the initial basic feasible solution to the following transportation
problem by minimum cost method and North-West corner rule 10
B1 B2 B3 Supply
A1 0 2 1 6
A2 2 1 5 9
A3 2 4 3 5
Demand 5 5 10
OR
Write the advantages and disadvantages of simulation. 5
Explain about sensitivity analysis. 5