Operation Research

Assignments:1

Solve the following numerica’s Graphically:

1. MaximizeZ=1x+1yS.T.1x+2y 20001x+1y 15000x+1y 600 and both

x and y are 0.

2. Maximise Z = 8000a + 7000b S.T. 3a+1b 66 1a+1b 451a+0b 20

0a+1b 40 and both a and bare 0.

3. MinimiseZ=1.5x+2.5yS.T. 1x+3y3 1x+6y 2 and both x and y 0

4. MaximiseZ=3a+2bS.T. 1a–1b 1 1a+1b 3 and both x and y are 0

5. MaximiseZ=–3x+2yS.T. 1x+0y3 1x–1y 0 and both x and y are 0

Simplex Method:

1. MinimizeZ=2x+9y+1zs.t 1x+4y+2z 5 3x+1y+2z 4andx,y,zallare

0,Solveforoptimalsolution.
2. MinimizeZ=3a+2b+1cs.t. 2a + 5b + 1c = 12
a+4b+0c=11andaisunrestrictedandbandcare
0,solveforoptimalvaluesofa,b and c.
3. MaxZ=22x+30y+25zs.t 2x+2y+0z 100 2x+1y+1z 100 1x+2y+2z 100
andx,y,zall 0Findtheoptimalsolution.
4. Obtain the dual of the following linear programming problem. Maximize
Z = 2x + 5y + 6z s.t.5x+6y–1z 3–1x+1y+3z 4 7x–2y–1x 101x–
2y+5z 3 4x+7y–2z=2andx,y,zall 0
5. Use dual simplex method for solving the given problem. Maximize Z = 2a
– 2b – 4c s.t2a+3b+5c 23a+1y+7z 3 1a+4b+6c 5anda,b,call 0
6. Find the optimum solution to the problem given: Maximize Z = 15x + 45y
s.t.1x+16y 2405x+2y 162 0x+1y 50andbothxandy 0If Zmax and c2 is
kept constant at 45, find how much c1 can be changed without
From / To A B C Crates Available.

X 75 50 50 1040

Y 50 25 75 975

Z 25 125 25 715

Crates
1300 910 520 2730
required.

From: To

A B C D
XYZ
835 9 4 3 12 3 7 8 2 4

To demand
points
(Transportati
From Warehouses Availability in units.
on cost in
Rs. per
units).

XYZ

A 5 10 2 100

B 375 25

C 684 75

Units demand: 105 30 90

affecting the optimal solution.

 Operation Research

Assignments:2

Transportation Problem:

1.The DREAM - DRINK Company has to work out a minimum cost

transportation schedule to distribute crates of drinks from three of its
factories X, Y, and Z to its three warehouses A, B, and C. The required
particulars are given below. Find the least cost transportation schedule.
Transportation cost in Rs per crate.

2.The demand pattern for a product at for consumer centers, A, B, C and D are
5000 units, 7000 units, 4000 units and 2000 units respectively. The supply
for these centers is from three factories X, Y and Z. The capacities for the
factories are 3000 units, 6000 units and 9000 units respectively. The unit
transportation cost in rupees from a factory to consumer center is given
below in the matrix. Develop an optimal transportation schedule and find
the optimal cost.

3.From three warehouses, A, B, and C orders for certain commodities are to be

supplied to demand points X, Y, and Z. Find the least cost transportation
schedule with relevant information given below:

206 Operations Research 12. From three warehouses A, B, and C orders for
certain commodities are to be supplied to

demand points 1, 2, 3, 4 and 5 monthly. The relevant information is given

below:

During certain month a bridge on the road-connecting warehouse B to demand

point 3 is closed for traffic. Modify the problem suitably and find the least cost
transportation schedule. (The demand must be complied with).

13. A tin box company has four factories that supply to 5 warehouses. The
variable cost of manufacturing and shipment of one ton of product from each
factory to each warehouse are shown in the matrix given below, Factory
capacities and warehouse requirements are shown in the margin. After several
iterations the solution obtained is also shown.

(a)  Is this an optimal solution? How do you know?

(b)  Is there an alternate solution? If so find it.

(c)  Suppose some new equipment was installed that reduces the variable
operation cost by Rs. 2/- per ton in factory X, is the shipping schedule
remain optimum? If not what is the new optimum?

(d)  Suppose the freight charges from W to A were reduced by Rs.2/-

would this change the shipping schedule? If so what is the new optimum?

(e)  How much would the manufacturing cost have to be reduced in W

before production would be increased beyond 55 tons?

Assignment Problems:

A bookbinder has one printing press, one binding machine and the
manuscripts of a number of different books. The times required to
perform printing and binding operations for ach book are known.
Determine the order in which the books should be processed in order to
minimize the total time required to process all the books. Find also the
total time required processing all the books. Printing time in minutes.
Suppose that an additional operation, finishing is added to the process
described above, and the time in minutes for finishing operation is as
given below what will be the optimal sequence and the elapsed time.
(Answer for two processes: sequence is ABEDCand the elapsed time is
340 min. For three processes: the optimal sequence is: DAEBC and the
total elapsed time is 510 min.)

A ready-made garments manufacturer has to process 7 items through two

stages of production, i.e. Cutting and Sewing. The time taken for each of
these items at different stages are given in hours below, find the optimal
sequence and total elapsed time.

BOOK: A B C D E
 Printing time: 40 90 80 60 50

Binding Time: 50 60 20 30 40

BOOK: A B C D E

Finishing time
80 100 60 70 110
(min):

Item: 1 2 3 4 5 6 7

Cutting time in
5 7 3 4 6 7 12
Hrs.:

Sewing time in Hrs: 2 6 7 5 9 5 8

Suppose a third stage of production is added, say pressing and packing with
processing time in hours as given below, find the optimal sequence and elapsed
time.

(Answer: For two stages the sequence is 3457261 and the time is 46 hours. For
three stages the sequence is 1436257 and the time is 86 hours.)

Find the optimal sequence for the following sequencing problem of four jobs
and five machines when passing is not allowed. The processing time given is in
hours. (Ans: Sequence: 1324, Time: 43 hours).

Find the optimal sequence and total elapsed time for processing two jobs on 5
machines by graphical method. (Answer: 1,2 for A, 1,2 for B, 2,1, for C, 2,1, for
D and 2,1for E and the time is 20 hours).

The tourist bureau of India wants to find the optima tour policy of five cities A,
B, C, D and E starting from city A and finally returning to city A after visiting
all cities. The cost of travel in rupees is given below. Find the optimal policy.
(Answer: Sequence: ABCDEA, The cost is Rs. 95/-

Pressing time
10 12 11 13 12 10 11
(Hrs)
JOBS: 1 2 3 4

A 6 5 4 7

B 4 5 3 2

Machines: C 1 3 4 2

D 2 4 5 1

E 8 9 7 5

Time in hours: 2 3 4 6 2
Job 1:
Order of
A B C D E
machining:

Time in hours: 4 5 3 2 6
Job2:
Order of
B C A D E
machining:
 Operation Research

Assignment:4
Replacement Models:
1. The following is the cost of running a particular car to date and the
forecast into the future. Assume that a similar car will replace the car,
when is the best time to replace it and what will be the average yearly
running cost?

Year: 1 2 3 4 5 6

Maintenance Cost in
200 500 800 1200 1800 2500
Rs.

Resale value at the end

Year Petrol andTax during the year. Rs.
of the year. Rs.

0 700 —

1 625 90

2 575 90

3 550 90

4 500 90

5 450 90

6 450 90

7 350 90

8 300 90
(Ans. 3rd year).

2. Machine B costs Rs. 10,000/-. Annual operating costs are Rs. 400/- for
the first year and they increase by Rs. 800/- each year. Machine, A which
is one year old, costs Rs. 9000/- and the annual operating costs are Rs.
200/- for the first year and they increase by Rs. 2000/ - every year.
Determine at what time is it profitable to replace machine A with machine
B. (Assume that machines have no resale value and the future costs are
not discounted).
3. A firm pays Rs. 10,000/- for its automobiles. Their operating and
maintenance costs are about Rs. 2,500/- per year for the first two years
and then go up by Rs. 1500/- approximately per year. When should such
vehicles be replaced? The discount rate is 0.9.
4. The cost of new machine is Rs. 4000/-. The maintenance cost of ‘n’ th
year is given by Rn = 500 (n – 1) where n = 1,2,3...n. Suppose that the
discount rate per year is 0.05. After how many years will it be economical
to replace the machine by a new one? (Ans: After 4 years)
5. If you wish to have a return of 10% per annum on your investment, which
of the following plans would you prefer? (Ans: Plan A).
6. The following mortality rates have been observed for a certain type of
light bulbs: There are 1000 bulbs in use and it costs Rs.2/- to replace an
individual bulb, which has burnt out. If all bulbs were replaced
simultaneously, it would cost 50 paise per bulb. It is proposed to replace
all the bulbs at fixed intervals, whether or not they have burnt out, and to
continue replacing burnt out bulbs as they fail. At what intervals should
all the bulbs be replaced? (Ans: At the end of 2 weeks).
7. The probability pn of failure just before age ‘n’ years is shown below. If
individual replacement cost is Rs.1.25 and group replacement cost is Re.
0.50 per item, find the optima group replacement policy. (Ans: After
every 6 weeks)
8. A fleet owner finds from his past records that the costs per year of
running a truck whose purchase price is Rs. 6,000/- are as follows:
(Ans: At the end of 5th year) 12. The following mortality rates have been
found for a certain type of coal cutter motor
9. If the motors are replaced over the week and the total cost is Rs. 200/-. If
they fail during the week the total cost is Rs. 100/- per failure. Is it better
to replace the motors before failure and if so when?
(Ans: Motors should be replaced every 20 weeks)

Operation Research

Assignment:3

Queueing Model:

1. Explain with suitable examples about the queue. Why do you consider
the study of waiting line as an important aspect?
2. Explain with suitable examples about Poisson arrival pattern and
exponential service pattern.
3. Explain the various types of queues by means of a sketch and also give
the situations for which each is suitable.
4. Customers arrive at one window drive in a bank according to a Poisson
distribution with a mean of 10 per hour. Service time per customer is
exponential with a mean of 5 minutes. The space in front of the
window, including that for the serviced car can accommodate a
maximum, of three cars. Other cars can wait outside the space.

a. What is the probability that an arriving customer can drive directly

to the space in front of the window?

b. What is the probability that an arriving customer will have to wait

outside the indicated space?

c. (c) How long an arriving customer is expected to wait before

starting service?(d) How much space should be provided in front of
the window so that all the arriving
customers can wait in front of the window at least 90 percent of the time?

5. A barber with a one-man shop takes exactly 25 minutes to complete

one hair cut. If customers arrive in a Poisson fashion at an average rate
of every 40 minutes, how long on the average must a customer wait for
service?
6. At a public telephone booth in a post office arrivals are considered to
be Poisson with an average inter-arrival time of 12 minutes. The length
of phone call may be assumed to be distributed exponentially with an
average of 4 minutes. Calculate the following:

a. (a)  What is the probability that a fresh arrival will not have to wait
for phone?

b. (b)  What is the probability that an arrival will have to wait more
than 10 minutes before the phone is free?

c. (c)  What is the average length of queues that form from time to
time?

d. (d)  What is the fraction of time is the phone busy?

e. (e)  What is the probability that an arrival that goes to the post
office to make a phone call will take less than 15 minutes to
complete his job?

f. (f)  The telephone company will install a second booth when

convinced that an arrival would expect to have to wait at least 5
minutes for the phone?

7. At what average rate must a clerk at a super market work in order to

ensure a probability of 0.90 that the customer will not wait longer than
12 minutes? It is assumed that there is only one counter at which
customer arrive in a Poisson fashion at an average rate of 15 per hour.
The length of service by the clerk has an exponential distribution.