BHAGALPUR COLLEGE OF ENGINEERING, BHAGALPUR

Operation Research
Time: 3 hours Mechanical- 7th Semester Full Marks: 70
Instructions:
 The marks are indicated in right hand margin.
 There are total Nine questions in the paper.
 Question No. 1 is compulsory.
 Attempt any Five questions in all.
1. Chose the correct answer/fill in the blanks (any seven) of the following. 2*7=14
(i) Comment on the LP and graphical method for aggregate planning
a) Graphical- Optimization approach, LP –Optimization approach
b) Graphical- Optimization approach, LP –Evaluative approach
c) Graphical- Evaluative approach, LP –Optimization approach
d) Graphical- Evaluative approach, LP –Evaluative approach
(ii) The difference between total float and head event slack is
a) free float
b) independent float
c) interference float
d) linear float

(iii) Every basic feasible solution of a general assignment problem, having a square pay-off
matrix of order, n should have assignments equal to
a) 2n+1
b) 2n-1
c) m+n-1
d) m+n+1

(iv) In PERT, the activity time distribution is

a) Beta
b) Normal
c) Poisson
d) Binomial

(v) When the lead time and demand are deterministic, reorder level is
a) Lead time
b) Sum of lead time and demand
c) Demand during lead time
d) Economic Order Quantity

(vi) The activity cost corresponding to the crash time is called

a) Cost slope
b) Critical cost
c) Crash cost
d) Normal cost

(vii) Johnson’s rule for scheduling is applicable for planning a job shop for
a) n machines 2 jobs
b) n machines n jobs
c) 2 machines n jobs
d) 1 machine n jobs
 (viii) In a single server queuing model, the arrival rate is A, and the service rate is μ. What is the
probability of system being idle?
a) λ/µ
b) 1- λ/µ
c) (1-λ)/µ
d) µ/λ

(ix) Which of the following is/are property/properties of a dynamic programming problem?

a) Optimal substructure
b) Overlapping sub-problems
c) Greedy approach
d) Both optimal substructure and overlapping sub-problems

(x) The degeneracy in the transportation problem indicates that

a) Dummy allocation(s) needs to be added
b) The problem has no feasible solution
c) The multiple optimal solution exist
d) None of the above

2. (a) What is the objective of OR? Describe various phases of OR methodology? 7

(b) A manufacturer produces two types of medicines A & B on a manufacturing plant
of medicine. There are sufficient ingredients available to make 2000 bottles of A
and 4000 bottles of B but there are only 4500 bottles into which either of the
medicines can be put. Furthermore it takes 3 hours to prepare enough material to fill
100 bottles of A and it takes 1 hour to prepare enough material to prepare 100
bottles of B and there are 66 hours available for this operation. The profit is ₹ 8 per
bottle for A and ₹ 7 per bottle for B. Formulate the LPP and solve graphically. 7

3. A dentist schedules all his patients for 30 minutes appointments. Some of the patients
take more or less than 30 minutes depending upon the type of dental work to be done.
The table shows the various categories of work their probabilities and the actual time to
complete the work.

Category Time required (in minutes) Probability of category

Filling 45 0.40
Crown 60 0.15
Cleaning 15 0.15
Extraction 45 0.10
Check-up 15 0.20
Simulate the dentist clinic for four hours and determine average waiting time for the
patients as well as idleness of doctor. Assume all the patients come to clinic on the schedule
arrival time starting at 08:00 am. Use following random numbers for this problem: 40, 82, 11,
34, 25, 66, 17, 79. 14

4. (a) Use simplex method to solve the following Problem: Maximize Z = 3x1+2 x2+5x3
Subjected to: x1 + x2 + x3 ≤ 9
2x1+3x2 +5x3 ≤ 30
2x1- x2 - x3 ≤ 8
 x1, x2, x3 ≥ 0 10
(b) Write the Dual of following LPP: Minimize Z = 3x1- 2x2 + x3
Subjected to: 2x1-3x2 +x3≤ 5
4x1-2x2+ ≥ 9
-8x1+4x2 + 3x3 = 7
x1, x2, ≥ 0 x3 is unrestricted. 4

5. Solve the following transportation problem and check for optimality using MODI
method to determine the optimum transportation cost. 14

To P Q R S T Supply
From
A 68 35 4 74 15 18
B 57 88 91 3 8 17
C 91 60 75 45 60 19
D 52 53 24 7 82 13
F 51 18 82 13 7 15
Demand 16 18 20 14 14

6. (a) A company purchases bottles from the market. The per day demand of bottles is 60.
The cost per order is ₹ 50 and carrying cost is 15% of the unit cost. Assuming 300
working days a year calculate the EOQ and minimum inventory cost for the price break
given below: 7
Lot Size Unit price in ₹
0 < q < 1999 ₹ 65
2000 ≤ q <4999 ₹ 60
5000 ≤ q< 9999 ₹ 55
Over 9999 ₹ 50
(b) State and explain ABC analysis with an example. 7

7. (a) There are seven jobs each of which has to go through the machines A & B in the
order AB. Processing times in hours are given as:
Job 1 2 3 4 5 6 7
Machine A 3 12 15 6 10 11 9
Machine B 8 10 10 6 12 1 3
Determine the sequence of these jobs that will minimize total elapsed time. Also
determine the idle time for both the machines A & B. 7
(b) The table given below gives the list of activity with predecessors and the three time
estimates in weeks. 7
Activity Predecessors activity Optimistic time Most Likely time Pessimistic time
A - 1 2 9
B A 2 3 4
C A 2 4 6
D A 3 5 7
E C 5 7 9
 F D 1 3 5
G B 1 4 7
H G 2 6 10
I E,H 4 8 6
J F 2 6 1
Draw the project network and find critical path. Also find the probability of completion
in 21 weeks and 25 weeks.

8. Discuss in brief about the Kendall’s notation in queuing system.

In a manufacturing tool room, workers come to receive tools needed by them to
perform given task. The average time between two arrivals is 60 seconds with arrival
rate following Poisson distribution. The average service time by tool room attendant is
40 seconds. Determine Average queue length, Average length of non-empty queues,
Average number of workers in the system, mean waiting time of arrival and average
waiting time of worker who has arrived for service. 14

9. Use dynamic programming to solve the following problem: 14

Minimize Z = x12+ x22+ x32
Subjected to: x1+x2 +x3 ≥ 15
x1, x2, x3 ≥ 0