Set No.

Code No:310502

III B.Tech., I-Semester Regular Examinations, November-2003 1

OPERATION RESEARCH
(Common to Computer Science and Engineering, Electronics and Computer
Engineering)
Time: 3hours Max.Marks:80
Answer any FIVE questions
All questions carry equal marks
----
1.a) Discuss the scope and significance of OR in business.
b) Explain the duality theory of linear programming.

2. Solve the following transportation problem.

Availability
D1 D2 D3 D4 D5

4 7 3 8 2 4
O1
1 4 7 3 8 7
O2
7 2 4 7 7 9
O3
Demand
4 8 2 4 7 2
O4
3.a) The owner of 8 3 7 2 2 22
a small
machine shop has four machinists available to assign to jobs for the day. Five jobs are
offered with the expected profit (in hundreds of rupees) for each machinist on each
job being as follows :
Machinist A B C D E
1 6 8 5 10 8
2 7 9 6 7 6
3 9 9 11 7 8
4 5 6 9 8 8
Find the assignment of machinists to jobs that result in a maximum profit. Which job
should be declined.
b) Find the sequence that minimizes total elapsed time required to complete the
following jobs :

Job number : 1 2 3 4
Machine A : 4 3 7 5
Machine B : 6 7 8 4

(Contd..2)
Code No:310502 -2- Set No:1
4. A machine has been purchased at a cost of Rs.1,60,000. The value of the machine is
depreciated in the first three years by Rs.20,000 each year and Rs.16,000 per year
thereafter. Its maintenance and operating costs for the first three years are Rs.16,000
Rs.18,000 and Rs.20,000 in that order and increase by Rs.4000 every year. Assuming
an interest rate of 10%,find the economic life of the machine.

5. Solve the following game by algebraic method

B
1 2
1 -2 -4
A
2 -1 3
3 1 2

6. Patients arrive at a clinic according to a poisson distribution at the rate of 30 patients

per hour. The waiting room does not accommodate more than 14 patients.
Examination time per patient is exponential with mean rate 20 per hour.
a) Find the effective arrival rate at the clinic.
b) What is the probability that an arriving patient will not wait ?
c) What is the expected waiting time until a patient is discharged from the clinic.

7.a) Explain the relevant costs for inventory decisions. How are these costs controlled by
operations research techniques?
b) A maintenance supply company has annual demand of 400 motors, which cost them
Rs 1,020 each. Ordering costs are Rs 38 per order, carrying costs are Rs 200 per
motor per year. Back ordering costs are approximately Rs 90 per item. How many
units can be back ordered and what is the economic order quantity.

8.a) What kind of problems can be solved by dynamic programming?

b) A sub contractor to Automobile industry has committed to supply at the end of each
month during January to June a casting PE1806. The number of units to be supplied
fluctuate from month to month as given below:
January February March April May June
10 25 10 25 30 15
Batches of the casting are manufactured at a set up cost of Rs.300 for each. The
inventory carrying cost is estimated at Rs.15 per unit per month. Schedules for
production during a month are ready at the beginning of the month and a batch
schedule for production will be completed by the end of the month.
Castings produced over and above the requirement during a particular month can be
stocked. However, there should not be any stock at the end of June when the contract
terminates. Determine the optimal number of units to be manufactured each month
using dynamic programming.

!!!!!
 Set No.
Code No:310502

III B.Tech., I-Semester Regular Examinations, November-2003 2

OPERATION RESEARCH
(Common to Computer Science and Engineering, Electronics and Computer
Engineering)
Time: 3hours Max.Marks:80
Answer any FIVE questions
All questions carry equal marks
----
1.a) Define Operations Research.
b) Enumerate the main characteristics Operations Research.
c) Describe the phases of scientific method in Operations Research.

2. Solve the Transportation Problem.

Destinations

1 I II III Demand
2 5 1 0 20
Sources 3 3 2 4 10
4 7 5 2 15
Supply 9 6 0 15
5 10 15

3.a) A company has 4 machines of which to do 3 jobs. Each job can be assigned to one
and only one machine. The cost of each job on each machine is given in the following
table. What are the job assignments which will minimize the cost ?
Job Machine
M1 M2 M3 M4
J1 18 24 28 32
J2 8 13 17 18
J3 10 15 19 22
b) There are 5 jobs, each of which must go through the two machines A and B in the
order BA. Processing times (in hours) are given below. Determine a sequence for 5
jobs that will minimize the elapsed time.

Job : 1 2 3 4 5
Machine A : 3 6 8 8 4
Machine B : 5 1 9 2 12

4. A manufacturer is offered two machines A and B. A is priced at Rs.5000 and running

costs are estimated at Rs.800 for each of the first five years, creasing by Rs.200per
year in the sixth and subsequent years. Machine B, which has the same capacity as A,
costs Rs.2500 but will have running costs of Rs.1200 per year for six years, increasing
by Rs.2000 per year thereafter.If the money is worth 10% per year, which machine
should be purchased assuming that both machines will eventually be sold for a scrap
at a negligible value.
(Contd..2)
Code No:310502 -2- Set No:2
5.a) Briefly explain the limitations of game theory.
b) Find the optimum strategies for the following game by graphical method.
B
1 2 3 4 5
1 -1 3 4 -2 6
2 4 2 6 3 2 A

6. Customers arrive at one teller counter in a bank according to a poisson distribution

with mean 12 per hour. Service time per customer is exponential with mean 6 minute.
The space in front of the counter can accommodate a maximum of 10 customers.
Other customers can wait outside the space.
a) What is the probability that an arriving customer can come directly to the counter?
b) What is the probability that an arriving customer will have to wait outside the
indicate space?
c) How long an arriving customer is expected to wait before starting service ?

7.a) Derive an expression for economic production quantity with uniform rate of
replenishment with no shortages.
b) A company uses 8,000 units of a product per year, costing Rs 10 per unit. The
administrative costs per purchase are Rs 40. The holding costs are 28% of the unit
price of the product. The company is following E.O.Q purchase policy. The
company is offered a discount of 1% if the total requirement is purchased in four
times in a year only, should the offer be accepted.

8.a) What are the applications of dynamic programming?

b) A 4 ton vessel is loaded with one or more of three items. The following table gives
the unit weight, wi in tons and unit revenue ri in thousands of rupees for item i. How
should the vessel be loaded to maximize the total return? Use dynamic programming
approach.

Item i wi ri
1 4 70
2 1 20
3 2 40

!!!!!

Set No.
Code No:310502
3
 III B.Tech., I-Semester Regular Examinations, November-2003

OPERATION RESEARCH
(Common to Computer Science and Engineering, Electronics and Computer
Engineering)

Time: 3hours Max.Marks:80

Answer any FIVE questions
All questions carry equal marks
----
1.a) Show on a graph the following:
i. Unbounded solution space.
ii. No feasible solution space.
b) Solve the following LPP graphically:
Maximize Z = 2x1 + 3x2
Subject to : x1 + x2 ≥ 1
5x1 – x2 ≥ 0
x1 + x2 ≤ 6
x1 – 5x2 ≤ 0
x2 – x1 ≥ -1
x2 ≤ 3
x1, x2 ≥ 0

2. A steel company has three hearth furnaces and five rolling mills. Transportation cost
in Rs. Per ton for shipping steel from furnaces to rolling mills are shown in the
following table. Determine the minimum transportation cost.
Mill
1 2 3 4 5 Availability
1 40 20 30 20 60 8
Furnaces 2 52 42 50 22 12 12
3 60 50 45 72 35 14
Requirements: 4 4 6 8 8

3.a) What is an unbalanced assignment problem? Explain the various steps involved in
solving it.
b) A company has 4 machines to do 3 jobs. Each job can be assigned to one and only
machine .The cost of each job on each machine is given in the following table.
Machines
1 2 3 4
A 18 24 28 32
Jobs
B 8 13 17 19
C 10 15 19 22
What are job assignments which will minimise the cost?

(Contd..2)
Code No:310502 -2- Set No:3
4.a) Briefly explain what you mean by “individual and group replacement policy” in
Replacement Analysis.
b) There is a special light bulb that never lasts longer than 2 weeks. There is a chance of
0.3 that a bulb will fail at the end of first week. There are 100 new bulbs initially. The
cost for individual replacements is Rs.1.25 and the cost per bulb for group
replacement is Re.0.50. Is it cheaper to replace all the bulbs,
(i) individually
(ii) every week
(iii) every second week

5.a) Explain briefly:

(i) Competitive games
(ii) Zero-sum games
(iii) Trategy
b) Find the solution of the following game
B

I II III A
I 1 3 11
II 8 5 2

6. A box-office ticket window is manned by single server. Customers arrive to purchase

tickets according to a Poisson input process with a mean rate of 30 per hour. The time
required to serve a customer has an exponential distribution with mean of 80 seconds.
Determine the following :
a. Fraction of time the server is busy
b. The probability of having more than 12 customers in the system.
c. The average number of customers queuing for more than 3 minutes.

7.a) Derive an expression for economic order quantity with uniform rate of replenishment
when shortages are allowed.
b) A publishing house purchases 2,000 units of a particular item per year at unit cost of
Rs 20, ordering cost per order is Rs 50 and inventory carrying costs is 25% of the unit
cost per year. Find the optimum order quantity and total cost per year for the item. If
3% discount is offered by the supplier for the purchase in lots of 1000 units or more
should the publishing house accept the proposal?

8. Solve the following model of the optimal subdividing of a cable of length 20 units
into 4 parts such that the product of their lengths is maximized using dynamic
programming technique.
Maximize Z = p1p2p3p4
Subjected to p1 +p2 + p3 + p4 = 20; p1, p2, p3, p4 ≥ 0

!!!!!
 Set No.
Code No:310502

III B.Tech., I-Semester Regular Examinations, November-2003 4

OPERATION RESEARCH
(Common to Computer Science and Engineering, Electronics and Computer
Engineering)

Time: 3hours Max.Marks:80

Answer any FIVE questions
All questions carry equal marks
----
1.a) How are the following detected in simplex method ?
i) Alternate solution ii) Unbounded solution iii) Infeasible solution.
b) Solve the following LPP using simplex method.
Maximize Z = 5x1 + 3x2
Subject to : 3x1 + 5x2 ≤ 15
5x1 + 2x2 ≤ 10
x1, x2 ≥ 0

2. A company has three plants at locations A,B and C which supply to warehouses
located at D,E,F,G and H. Monthly plant capacities are 800 , 500 and 400 units
respectively. Unit transportation costs (in hundreds of rupees) are given below :
From/To D E F G H
A 5 8 6 6 3
B 4 7 7 6 6
C 8 4 6 6 3
Monthly warehouse requirements are 400, 400, 500, 400 and 800 units respectively.
By using Vogels Approximation Method determine on optimum distribution for
company, in order to minimize the total transportation cost.

3.a) What do you mean by “ Total elapsed time” as referred to sequencing of

jobs in machines?
b) Explain Johnson’s procedure of solving sequencing problems
c) Find the sequence that minimises the total elapsed time required to complete
the following jobs on machines M1, M2 and M3 in the order M1, M2, M3.

Task A B C D E F

Machine
M1 8 3 7 2 5 1
M2 3 4 5 2 1 6
M3 8 7 6 9 10 9

(Contd..2)
Code No:310502 -2- Set No:4

4. A series lamp circuit contains 10,000 bulbs. When any bulb fails, it is replaced. The
cost of replacing a bulb individually is Re.1 only. If all the bulbs are replaced
simultaneously, the cost per bulb would be Re.0.35. The percent of surviving, say s(t)
at the end of the month ‘t’ and p(t) probabilities of failure during the month are given
below:
t 0 1 2 3 4 5 6
s(t) 100 97 90 70 30 15 0
p(t) - 0.03 0.07 0.20 0.40 0.15 0.15
what is the optimal replacement?

5.a) Briefly explain the general rules for dominance.

b) Use dominance property to reduce the game to 2x2 game and hence find the optimal
strategies
player B

5 -10 9 0
6 7 8 1
8 7 15 1 player A
3 4 -1 4

6. A car park has space to accommodate 40 cars. The arrival of cars is Poisson at a mean
rate of 2 per minutes. The length of time each car spends in the car park has negative
exponential distribution with mean of 30 minutes? (a) How many cars are in the car
park on average ? (b) what is probability of a newly arriving customer finding the car
park full ? (c) what is the probability of having zero cars in the car park space ?

7.a) Consider an inventory model in which the cost of holding one unit in inventory for a
specified period is C1 and the cost of shortage per unit is C2. Also, suppose the
demand follows a known continuous probability distribution. Determine the optimum
inventory level in the beginning of the period.
b) A shopkeeper has to decide how much quantity of bread he should stock every week.
The quantity of bread demand in any week is assumed to be continuous random
variable with a given probability function f (x). Let A= Rs 8 be the unit cost of
purchasing the bread, B= Rs 20 unit sale price, C= Rs 2 refund on unit stale bread and
D= Rs 5 is the unit penalty cost. Find the optimum quantity of bread to be stocked.

8. Solve following L.P.P by Dynamic programming

Max Z = 8x1 + 7x2 subjected to the constraints
2x1 + x2 ≤ 8
5x1 + 2x2 ≤ 15.

!!!!!