Code No: RR311303 Set No.

1
III B.Tech I Semester Regular Examinations, November 2007
OPERATIONS RESEARCH
(Electronics & Control Engineering)
Time: 3 hours Max Marks: 80
Answer any FIVE Questions
All Questions carry equal marks
⋆⋆⋆⋆⋆

1. (a) Discuss Scientific method in OR

(b) Write down the dual of the following LP Problem and solve it.
Maximize Z=4X1 +2X2
Subject to the constraints
-X1 -X2 ≤-3
-X1 +X2 ≤-2 and X1 ,X2 ≥0 [4+12]

2. Consider the following transportation problem and find an optimum solution [16]
Demand points
1 2 3 4 ↓ Supply
1 2 3 11 7 6
Source 2 1 0 6 1 1
3 5 8 15 9 10
Demand 7 5 3 2 17

3. (a) Solve the following minimal assignment problem :

Job Machinist
1 2 3 4
A 12 30 21 15
B 18 33 9 31
C 44 25 24 21
D 23 30 28 14
(b) Find the sequence that minimizes the total elapsed time (in hours) required to
complete the following jobs on three machines ABC in the order BAC. [8+8]
Job Nummber 1 2 3 4
Machine A 9 7 3 7
Machine B 5 5 6 12
Machine C 1 2 4 3

4. (a) Equipment A costs Rs.9000. Annual operating costs are Rs.200 for the first
year and then increases by Rs.2,000 every year. Determine the best age at
which to replace the equipment.
(b) Equipment B costs Rs.10,000.Annual operating costs are Rs.400 for the first
year and then increases by Rs.800 every year. Now you have a equipment of
type A which is one year old. Should you replace it with B,if so when? [8+8]

5. (a) Write a note on:

1 of 2
Code No: RR311303 Set No. 1
i. Saddle point
ii. value of the game
(b) For the following matrix of pay-offs find saddle point. If there is no saddle
point. Find the optimal strategies, their frequencies and value of the game.
[4+12]
B
1 2
A
1 -2 3
2 4 -1
6. A firm is engaged in both shipping and receiving activities. The management
is always interested in improving the efficiency by new innovations in loading and
unloading procedures. The arrival distribution of trucks is found to be poisson with
arrival rate of two trucks per hour. The service time distribution is exponential
with unloading rate of three trucks per hour. Find the following:
(a) average number of trucks in the waiting line
(b) the average waiting time of trucks in line
(c) the probability that the loading and unloading dock and workers will be idle.
(d) What reductions in waiting time are possible if loading and unloading is stan-
dardized.
(e) What reductions are possible if lift trucks are used. [16]
7. (a) Explain selective inventory control and state the different selection techniques
adopted in inventory control systems. Give a brief note on each.
(b) Find the economic order quantity for the given data below:
Annual demand: 5000 units
Unit cost of the item: Rs 20 per unit
Ordering cost: Rs 300 per order
Inventory holding cost: 20% of the unit cost [6+10]
8. A man is engaged in buying and selling identical item. He operates from a ware-
house that can hold 500 items. Each month he can sell any quantity that he chooses
up to the stock at the beginning of the month. Each month he can buy as much as
he wishes for delivery at the end of the month. So long as his stock does not exceed
500 items. For the next four months he has the following error free forecasts of the
cost sales prices.
Month i 1 2 3 4
Cost Ci 27 24 26 28
Sales price Pi 28 25 25 27
If he currently has a stock of 200 units, what quantity should he sell and buy next
four months. Find the solution using dynamic programming. [16]

⋆⋆⋆⋆⋆

2 of 2
Code No: RR311303 Set No. 2
III B.Tech I Semester Regular Examinations, November 2007
OPERATIONS RESEARCH
(Electronics & Control Engineering)
Time: 3 hours Max Marks: 80
Answer any FIVE Questions
All Questions carry equal marks
⋆⋆⋆⋆⋆

1. (a) Construct the dual of the problem.

Minimize Z = 3X1 - 2X2 + 4X3
Subject to the constraints
3X1 + 5X2 + 4X3 ≥ 7
6X1 + X2 + 3X3 ≥ 4
7X1 - 2X2 - X3 ≤ 10
X1 - 2X2 + 5X3 ≥ 3
4X1 + 7X2 - 2X3 ≥ 2 and
X1 , X 2 , X 3 ≥ 0
(b) Solve the following LPP by using Simplex method.
Maximize Z = 45X1 + 80X2
Subject to
5X2 + 20X2 ≤ 400
10X1 + 15X2 ≤ 450 and
X1 , X2 ≥0 [4+12]

2. Transbulk company has three warehouses A,B and C of capacities 50,60 and 40
respectively and four stores P,Q,R and S of capacities 20,70,50 and 10 respectively.
Cost (in hundreds of rupees ) of shipping one unit of commodity from various
warehouses to different stores are as follows :
Warehouse/Stores P Q R S
A 5 15 7 6
B 8 7 9 1
C 1.5 9 8 8
Workout the transportation schedule by using vogel?s approximation method and
find the minimum transportation cost. [16]

3. (a) Give the mathematical representation of an assignment problem

(b) The assignment cost of assigning any one operator to any one machine is given
in the following table.
Operators
I II III IV
A 10 5 13 15
Machine B 3 9 18 3
C 10 7 3 2
D 5 11 9 7
Find the optimal assignment by Hungarian method [4+12]

1 of 3
Code No: RR311303 Set No. 2
4. (a) Explain briefly “how the replacement problems are classified”?
(b) Fleet of cars have increased their costs as they continue in service due to in-
creased direct operating cost (gas and oil) and increased maintenance (repairs,
tyres, batteries,etc..).The initial cost is Rs.3,50,000 and the trade in value drop
as time passes until it reaches a constant value of Rs.40,000. Given the cost
of operating, maintaining and the trade in value, determine the proper length
of service before cars should be replaced. [4+12]

Years of service 1 2 3 4 5
Year end trade in value(Rs.) 2,90,000 2,10,000 1,50,000 1,10,000 40,000
Annual operatiing cost (Rs.) 11,500 12,800 13,600 14,000 15,000
Annual maintaining 3000 5000 8000 12,000 15,000

5. (a) Consider the following pay-off matrix and determine the optimal strategy.
B
I II III
I 6 9 4
A
II 5 10 7
III 9 8 9
(b) Write a note on zero-sum games [12+4]

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. [16]

7. (a) With the help of quantity cost curve explain the significance of EOQ.
(b) Determine the optimal order size, reorder point and expected cost per year
under the following conditions.
i. Deterministic demand at the rate of 2000 per year. Lead time is one tenth
of an year and no back orders are permitted.
ii. Same as above with back orders permitted with penalty cost of Rs.160
per back order. [6+10]

8. (a) State Belman?s principle of optimality and explain by an illustrative example,

how it can be used to solve multi stage decision problem.
(b) Define the following terms in dynamic programming :
i. Stage
ii. Decision variable
iii. Optimal return

2 of 3
Code No: RR311303 Set No. 2
iv. State transformation function. [8+8]

⋆⋆⋆⋆⋆

3 of 3
Code No: RR311303 Set No. 3
III B.Tech I Semester Regular Examinations, November 2007
OPERATIONS RESEARCH
(Electronics & Control Engineering)
Time: 3 hours Max Marks: 80
Answer any FIVE Questions
All Questions carry equal marks
⋆⋆⋆⋆⋆

1. A company makes three products P, Q and R and each product is to be processed

in 3 departments. The time taken for these are listed in the table shown.

Product Time in hours/unit

Department A Department B
P 4 3 2
Q 5 2 2
R 3 3 4
Total available time 75 70 40

Find the optimum product mix if the profit for each of the products is Rs.3, Rs. 5
and Rs.3.50 respectively. [16]

2. Solve the following transportation problem, the matrix represents the times tij :
[16]
To
P Q R S Availability
A 6 7 3 7 5
From B 7 9 1 5 7
C 6 5 16 7 8
D 18 9 10 2 10
Demand: 10 5 10 5
3. Find the sequence of hobs that minimize the total elapsed time to complete the
jobs with sequence M1 M2 .

Job 1 2 3 4 5
MachineM1 4 5 4 9 6
MachineM2 5 4 1 7 4

Also find the total elapsed time and idle times of each machine [16]

4. A machine has initial investment of Rs.30,000 and its salvage value at the end
of ‘i’ years of its use is estimated as Rs.30,000/(‘i’+1). The annual operating
and maintenance cost in the first year is Rs.15,000 and increases by Rs.1000 in
each subsequent years for the first five years and increases by Rs.5000 in each year
thereafter. Replacement policy is to be planned over a period of seven years. During
this period cost of capital may be taken as 10% per year. Solve the problem for
optimal replacement. [16]

1 of 2
Code No: RR311303 Set No. 3
5. Solve the following 2x3 game by method of sub-games [16]

B
1 2 3
A
1 -1 7 6
2 5 -3 3

6. (a) Explain the Kendal’s notation of representing queuing models and also the
conventional codes used
(b) There is congestion on the platform of a railway station. The trains arrive
at the rate of 35 trains per day. The waiting time for any train to hump
is exponentially distributed with an average of 38 minutes. Calculate the
following. The mean queue size and the probability of that the queue size
exceeds 10. [6+10]

7. (a) What is safety stock? Why are safety stocks necessary?

(b) A company uses annually 48,000 units of raw material costing Rs. 1.25 per
unit. Placing order costs Rs. 45 and carrying cost is 15% of average inventory.
Find the EOQ . Suppose the company follows EOQ policy and it operates for
300 days in a year. The procurement time is 12 days with a safety stock of
500 units. Find the reorder point, the maximum, minimum and the average
inventory. [6+10]

8. (a) What are the situations warranting the use of dynamic programming?
(b) Six units of capital is available to invest in four business ventures. The returns
from each unit of investment in all the four ventures are given in the table
below. Find how should the capital be allocated to business proposals in order
to maximize profit using dynamic programming. [4+12]

Ecpected returns from Business proposals

Unit A B C D
0 0 0 0 0
1 5 2 6 2
Capital 2 6 4 7 3
3 7 6 8 4
4 8 8 8 5
5 8 9 8 6
6 8 10 8 6

⋆⋆⋆⋆⋆

2 of 2
Code No: RR311303 Set No. 4
III B.Tech I Semester Regular Examinations, November 2007
OPERATIONS RESEARCH
(Electronics & Control Engineering)
Time: 3 hours Max Marks: 80
Answer any FIVE Questions
All Questions carry equal marks
⋆⋆⋆⋆⋆

1. (a) Explain briefly the general methods used for solving OR models.
(b) Solve the following LPP by graphical method.
Minimize Z = 20X1 + 10X2
Subject to
X1 + 2X2 ≤ 40
3X1 + X2 ≥ 30
4X1 + 3X2 ≥ 60
and X1 , X2 ≥ 0 [4+12]

2. Solve the following transportation problem. [16]

A B C D Supply
I 9 16 15 9 15
II 2 1 3 5 25
IIi 6 4 7 3 20
Demand 10 15 25 10

3. (a) Explain the various steps in the Hungarian Method used for solving assignment
problems.
(b) A batch of 4 jobs can be assigned to 5 different machines. The set up time (
in hours) for each job on various machines given below.
Machine
1 2 3 4 5
1 10 11 4 2 8
Job 2 7 11 10 14 12
3 5 6 9 12 14
4 13 15 11 10 7
Find an optimal assignment of jobs to machines which will minimise the total
set up time. [6+10]

4. There are 1000 bulbs in the system. Survival rate is given below
Week 0 1 2 3 4
Bulbs in operation at the end of the week 1000 850 500 200 00
The group replacement of 100 bulbs costs Rs.1000 and individual replacement is
Rs.20 per bulb. Suggest suitable replacement policy. [16]

5. (a) Briefly explain

i. pure strategy

1 of 2
Code No: RR311303 Set No. 4
ii. mixed strategy
iii. optimal strategy
(b) Find the saddle point, optimum strategies and value of the game in the fol-
lowing pay off matrix [6+10]
Y
A B C D
I -3 4 2 9
X
II 7 8 6 10
III 6 2 4 -1

6. For the case of two channels, Poisson arrivals and exponential services, show the
following:
(2µ−λ)
(a) Probability that birth channels are empty is (2µ+λ)
(4µλ)
(b) Expected number in the system is (4µ2 −λ2 )
[8+8]

7. (a) Derive the Economic Order Quantity Formula with instantaneous replenish-
ment when shortages are allowed.
(b) Given the following data for an item of uniform demand, instantaneous deliv-
ery time and Back order facility.
Annual demand = 900 units, cost of an item = Rs. 50/-, Ordering cost = Rs.
900/-, Inventory carrying cost = 30%, Back order cost = Rs. 15. Find out
i. Minimum cost order quantity
ii. Maximum number of back orders
iii. Maximum Inventory level
iv. Time between orders
v. Total annual cost. [8+8]

8. State Bellman’s principle of optimality and explain by an illustrative example how

it can be used to solve multistage problem with finite number of stages. [16]

⋆⋆⋆⋆⋆

2 of 2