U.S.N.

BMS College of Engineering, Bangalore-560019

Date: 19.12.2016
Instructions: Answer FIVE full Questions selecting one from each unit.
Use of normal distribution tables is permitted.

UNIT 1
1 a) What are the general methods for solving the OR models? Explain 06
b) Solve the following LPP by graphical method 06
Maximize Z=3x1+5x2 Subjected to
x1+2x2≤ 2000, x1+x2 ≤ 1500, x2 ≤ 600, and x1,x2≥0
c) Solve the LPP by simplex method 08
Max Z = 3x1+2x2+5x3 STC
x1+2x2+x3 ≤ 430
3x1+2x3 ≤ 460
x1+4x2 ≤ 420
x1,x2 and x3≥0
OR
2 a) What are the tools and techniques of operations research 04
b) Solve by Big M Method 10
Minimize Z = 2x1 +x2
STC x1+2x2 ≤4, 4x1+3x2 ≥6, 3x1+x2 =3 and x1,x2 ≥0
c) A firm can produce three types of cloth A,B and C . Three kinds of wool are 06
required for it. Red, green and blue .One unit length of type A cloth needs 2 meters
of red wool and 3 meters of blue wool. One unit length of type B cloth needs 3
meters of red wool, 2 meters of green wool and 2 meters of blue wool. One unit of
type C cloth needs 5 meters of green wool and 4 meters of blue wool. The firm has
only stock of 8 meters of red wool, 10 meters of green wool and 15 meters of blue
wool. It is assumed that the income obtained from one unit length of type A cloth is
Rs 3, type B cloth is Rs 5 and Type C cloth is Rs 4. Determine how the firm should
use the availability of material so as to maximize the income from the finish goods
UNIT 2
3 a) Find the Initial basic feasible solution of the following transportation problem by 08
VAM method and North west corner rule
Ware house W1 W2 W3 W4 Capacity
Factory
F1 19 30 50 10 7
F2 70 30 40 60 9
F3 40 8 70 20 18
Demand 5 8 7 14
 b) Find the optimal solution for the following transportation problem where all entries 12
are unit costs. Solve IBFS by least cost method.
D1 D2 D3 D4 D5 Available

O1 73 40 9 79 20 8
O2 62 93 96 8 13 7
O3 96 65 80 50 65 9
O4 57 58 29 12 87 3
O5 56 23 87 18 12 5
Demand 6 8 10 4 4
OR
4 a) Differentiate between assignment models and transportation models. 04
b) Solve the minimal assignment problem whose effectiveness matrix is given in the 08
table below
1 2 3 4
I 2 3 4 5
II 4 5 6 7
III 7 8 9 8
IV 3 5 8 4
c) Five sales men are to be assigned to five territories. Based on the past performance, 08
the following table shows the annual sales that can be generated by each salesman in
each territory. Find the optimum assignment
Territory
T1 T2 T3 T4 T5
S1 26 14 10 12 9
S2 31 27 30 14 16
Salesman S3 15 18 16 25 30
S4 17 12 21 30 25
S5 20 19 25 16 10
UNIT 3
5 a) Define the following terms with respect to network diagram with simple example 04
i)Predecessor activity
ii)Concurrent activity
iii)Dummy activity
b) A project has the following time schedule. Construct PERT network and compute 12
i)TE and TL for each event
ii)Determine Total Float, Free Float & Independent Float
iii)Critical path and its duration
Activity Time in Activity Time in
weeks weeks
1-2 4 5-7 8
1-3 1 6-8 1
2-4 1 7-8 2
3-4 1 8-9 1
3-5 6 8-10 8
4-9 5 9-10 7
5-6 4 ---- ----
 c) Differentiate PERT & CMP 04

UNIT 4
6 a) On an average 96 patients per 24 hrs a day require the service of an emergency 10
clinic. Also on average, a patient requires 10 mins of active attention. Assume that
the facility can handle only on emergency at a time. Suppose that it costs the clinic
Rs 100 per patient treated to obtain an average service time of 10 mins, and that
each minute of decrease in this average time would cost Rs 10 per patient treated.
How much would have to be budgeted by the clinic to decrease the average size of
the queue from 1 1/3 patients to 1 ½ patient.
b) Solve the game graphically whose payoff matrix for the player A is given as 10
follows
B
I II
I 2 4
A II 2 3
III 3 2
IV -2 6

UNIT 5
7 a) a. Define the following terms used in Sequencing 05
i. Processing order
ii. Processing time
iii. Idle time on a machine
iv. Total elapsed time
v. No passing rule

b) What are the principle assumptions made in solving a sequence problem. 05

c) Use graphical method to minimise the time needed to process the following jobs on 10
the machines shown below, ie. for each machine find the job which should be done
first. Also, calculate the total time needed to complete both the jobs

Job1 Sequence of Machines A B C D E

*******