Вы находитесь на странице: 1из 8

Set No

Code No: 420804


IV-B.Tech. II Semester Examination April, 2003

OPERATIONS RESEARCH
1
(Chemical Engineering)
Time: 3 Hours Max. Marks: 80
Answer any Five questions
All questions carry equal marks
---

1.a) List out the properties of a Linear Programming Problem and explain them with
respect to a resource allocation problem.
b) Does advent of computers have any effect on Operations Research? Explain with
suitable examples.

2.a) The manager of the oil company has to decide on the optimal mix of two possible
blending processes of which the input and outputs per production runs are as
follows:
Input (units) Output (units)
Process Crude A Crude B Gasoline X Gasoline Y

1 5 3 5 8
2 4 5 4 4

Maximum availability of cure A and B are 200 and 150 units respectively.
Market requirements show that at least 100 units of gasoline X and 80
units of gasoline Y must be produced. Profits per production run from
process 1 and process 2 is Rs. 300 and Rs. 400 respectively. Solve this as a
linear programming problem by graphical method.
b) Explain what is feasible area and closed polygon.

3.a) Explain the concept Johnson Bekman Rule in Hourd.


b) Find the sequence that minimizes the total elapsed time required to complete the
following jobs.
Job 1 2 3 4 5 6
Processing Ai 3 5 4 2 2 1
Time Bi 2 8 1 6 3 5

4.a) What are the applications of queuing theory?


b) Describe the advantage of queuing theory to a business executives with a view to
persuade him to make use of the same.

Contd….2
Code No: 420804 -2- Set-1

5. The following failure rates have been observed for a certain type of light bulbs:
End of week : 1 2 3 4 5 6 7 8
Probability of
failure to date :0.05 0.13 0.25 0.43 0.68 0.88 0.96 1.00
The cost of replacing an individual bulb is Rs 1.25. The decision is made to
replace all bulbs simultaneously at fixed intervals and also to replace individual
bulbs as they fail in service. If the cost of group replacement is 30 paise per bulb,
what is the best interval between group replacements?

6. A and B play a game in which each has three coins 5 paise,10 paise and 20 paise.
Each selects a coin without the knowledge of other’s choice. If the sum of coins is
an odd amount, A wins B’s coin. If the sum is even, B wins A’s coin. Find the
best strategies for each player and the value of the game.

7.a) Derive an expression for E.O.Q for an inventory model with uniform demand and
instantaneous replenishment with no shortages.
b) Explain why inventory control is important in an industry. Mention its
advantages and disadvantages.

8.a) Briefly discuss the applications of dynamic programming.


b) Solve the following problem by using dynamic programming.
Max.Z = x1+9x2
subject to 2x1+x2≤25
x2≤11
x1, x2 ≥ 0.

---
Set No
Code No: 420804
IV-B.Tech. II Semester Examination April, 2003

OPERATIONS RESEARCH
2
(Chemical Engineering)
Time: 3 Hours Max. Marks: 80
Answer any Five questions
All questions carry equal marks
---

1.a) What is a basic feasible solution and optimal solution in Linear Programming
Problem?
b) List out different Operations Research Models and explain any two of them
giving the uses of those models.

2. Write the dual of the problem given below:


Maximize Z = 2x + 5z subject to
1x + 1y ≥ 2
2x + 1y + 6z ≤ 6
1x – 1y + 3z = 4 and x,y and z all ≥ 0
Solve the dual for optimal solution.
Give the solution of Primal problem.

3. Find the sequence that minimizes the total elapsed time (in hours) required to
complete all the following jobs on machines M1, M2, M3, in the order M1, M2, M3.
Jobs
A B C D E
M1 4 9 8 6 5
M2 5 6 2 3 4
M3 8 10 6 7 11

4.a) Customers arrive at one window in a bank according to Poisson Distribution with
mean of 10/hour.Service time/customer is exponential with mean of 5 minutes.
The space in front of the window including that for serviced car can accommodate
a maximum of 3 cars. Other cars can wait outside this space.
i) What is the probability that an arriving customer can drive directly to a
space in front of the window?
ii) What is the probability that an arriving customer will have to wait
outside the indicated space?
b) Explain queue discipline.

Contd…..2
Code No: 420804 -2- Set-2

5. The owner of a stone crushing machine determines from his past records that the
cost per year for operating the machine is as shown in the table. The purchase
price of the machine was Rs.65000/- when new
Age 1 2 3
Running 1000 2000 4000
cost in Rs.
After 3 years, the operating cost is Rs.2000 x B, where B = 4,5,6… (B
indicating age in years). If the resale value decreases by 10% of the purchase price
every year, what is the optimum replacement policy.?

6. Two players A and B play the following game. A has a bag containing three
coins, one worth 1 unit, one worth 3 units and the rest worth 6 units. A takes one
coin from the bag and before it is exposed, B guesses what it is. If B guesses
rightly, he takes the coin, if he is wrong, he gives to A a coin of the same worth.
Find the best shorting and value of the game.

7. A commodity is to be supplied at a constant rate of 20 units per day. Supplies of


any amounts can be had at any required time but each ordering costs Rs 50. The
cost of holding the commodity in inventory is Rs 60 per unit per month of 30
days, while the delay in supply of the item induces a penalty of Rs 10 per unit
per day delay. Determine optimum order quantity and the corresponding
shortage quantity.

8.a) Enumerate Bellman’s principle of optimality.


b) Solve the following problem by using dynamic programming.
Max.x1 x2 x3
subject to x1+x2+x3 = 5
x1, x2, x3 ≥ 0.

---
Set No
Code No: 420804
IV-B.Tech. II Semester Examination April, 2003

OPERATIONS RESEARCH
3
(Chemical Engineering)
Time: 3 Hours Max. Marks: 80
Answer any Five questions
All questions carry equal marks
---

1.a) Operations Research is simply Research into Operations – Explain.


b) What are the properties of a Linear-programming Problem? Explain.

2.a) Clearly explain the significance of Slack variable in Resource allocation models.
b) A ship has three cargo holds, forward, aft and center. The capacity limits are

Forward; 2000 tons 100,000 cubic meter


Center: 3000 tons 135,000 cubic meter
Aft 1500 tons 30,000 cubic meter.
The following cargoes are offered. The ship owners may accept all or any par of
each commodity:

Commodity Amount tons Volume/ton Cub.mt. Profit per ton in Rs.

A 6000 60 60
B 4000 50 80
C 2000 25 50

In order to preserve the trim of the ship the weight in each hold must be
proportional to the capacity in tons. How should the cargo be distributed so as to
maximize profit? Formulate this as a Linear Programming problem. Write first
two iterations. Do not solve the problem.

3. A machine operator processes five types of items on his machine each week, and
must choose sequence for them. The set up cost per change depends on the item
presently on the machine and item to be made, according to the following table:
To item
A B C D E
A ∞ 4 7 3 4
From B 4 ∞ 6 3 4
item C 7 6 ∞ 7 5
D 3 3 7 ∞ 7
E 4 4 5 7 ∞
If he produces each type of item once and only once each week, how should he
sequence the items on his machine in order to minimize the total set up cost?
Contd…..2
Code No: 420804 -2- Set-3

4. The men’s department of a large store employs one tailor for a customer fittings.
The number of customers requiring fittings appears to follow a Process dynamic
with mean arrival rate of 24/hour. Consumers are fitted in a FCFS basis and they
are always willing to wait for the tailor’s service, because alterations are free.
The time taken to fit a customer is assumed to be exponentially distributed into a
mean of 12 minutes.
i) What is the average number of customers in the fitting from?
iii) How much time is a customer expected to spend in the fitting room?
iv) What % of the time is the tailor idle?

5. A computer contains 10000 resistors. When any one resistor fails it is replaced.
The cost of replacing a resistor individually is Re.1 only. If all the resistors are
replaced at the same time, the cost per resistor would be reduced to 35 paise. The
percent surviving at the end of month is given below.
Month : 0 1 2 3 4 5 6
Percent surviving
at the end of month : 100 97 90 70 30 15 0

What is the optimum replacement plan?

6.a) List the different strategies and explain them briefly.


b) Two players A and B match points .If the points match, then A wins one unit of
value, if the points do not match, then B wins one unit of value. Determine
optimum strategies for the players and the value of the game.

7.a) A Company uses annually 48000 units of a raw material costing Rs. 1.20 / unit.
Placing each order costs Rs. 45/-, carrying cost is 1.5 % /year of the average
inventory. Find E.O.Q and Minimum cost.
b) Discuss the impact on lot size if shortages are allowed.

8.a) Discuss the relation between linear and dynamic programming.


b) Solve the following problem by using dynamic programming.
n
Max. 12 x13 + 27 x 23 + 147 x33 in non negative x1 subject to ∑ x1 = 1
i −1

---
Set No
Code No: 420804
IV-B.Tech. II Semester Examination April, 2003

OPERATIONS RESEARCH
4
(Chemical Engineering)
Time: 3 Hours Max. Marks: 80
Answer any Five questions
All questions carry equal marks
---
1.a) Define Operations Research and discuss its scope.
b) Discuss the Scientific Method in Operations Research.

2.a) Maximize using Simplex Method.


Z = 10 x + 1 y + 2 z subject to
1x + 1y – 2 z ≤ 10
4 x + 1 y + 1 z ≤ 20
and x,y and z all ≥ 0
b) How do you solve degeneracy in Simplex method?

3.a) Explain necessary condition for solving jobs on 3 machines.


b) A book binder has one printing press, one binding machine, and the manuscripts
of a number of different books. The time required to perform the printing and
binding operations for each book are known. Determine the order in which books
should be processed on the machines, in order to minimize the total time required.
Book Printing time Binding time
1 20 60
2 120 100
3 50 90
4 30 80
5 90 30
6 110 10

4.a) A postal clerk can service a customer in 3 minutes, the service time being
experimentally distributed. The inter-arrival time of instruments is also
experimentally distributed with an average of 12 minutes during early morning
slack period and an average of 5 minutes during afternoon peak period. Assume
the average queue length and expected waiting time in the queue during the two
periods.
b) List out the main characteristic of queuing system.

Contd…..2
Code No: 420804 -2- Set-4

5. A decorative series lamp set circuit contains 1000 bulbs , all of which must be in
working condition. The mortality rates have been observed for a certain type of
light bulb:
End of week : 1 2 3 4 5 6
Probability of
failure during week : 0.10 0.15 0.25 0.35 0.12 0.03
If a bulb fails in service, it costs Rs.3.50 to replace; but if all the bulbs are
replaced at a time it costs Rs.1.20 each ,find optimum group replacement policy.

6. Two children play the following game named “scissors, paper, stone”. Both
players simultaneously call one of the three- scissors, paper or stone. Scissors beat
paper (as scissors cuts papers), paper beats stone (as stone can wrapped in paper)
and stone beats scissors(as stone can blunt scissors). There is a tie if both call the
same thing if there is one point for win, Zero for the tie and -1 for the loss. Form
the payoff matrix of the game and solve it and give the optimal strategies of the
players and the value of the game.

7.a) An automobile spares company has an annual demand for 5000 spares. The cost
of placing order is Rs. 250/- & inventory carrying cost is 30 % . The price / spare
is Rs. 50/-. The Supplier offers 2 % discount if 1000 or more spares are
purchased. What should be the ordering quantity?
b) Explain briefly : i) Sit up Cost ii ) Holding Cost iii ) Lead time.
Give examples.

8.a) Explain the concept of dynamic programming.


b) Consider loading a vessel with stock of three types of items. Each unit of item I
has a weight wi and a value ri (r = 1,2,3).
i wi ri
1 1 30
2 3 80
3 2 65
The maximum cargo weight W is 5. It is required to determine the most
valuable cargo load without exceeding the maximum weight of the vessel. Use
Dynamic Programming technique.

---

Вам также может понравиться