Professional Documents
Culture Documents
14 State the conditions under which 3 machine jobs sequencing problems equivalent 2 machines
and n jobs sequencing problem.
15 Compare broaching process with other manufacturing processes Find the Sequence that minimizes
the total time required in performing the following jobs on three machines in the order A-B-C as shown in
the below table .Also find the total elapsed time.
Machine/J 1 2 3 4 5 6
ob
Machine 8 3 7 2 5 1
A
Machine B 3 4 5 2 1 6
Machine c 8 7 6 9 10 9
truck
16 ) A truck is priced for Rs.60,000 and running costs are estimated at
should be
Rs.6000 for each of first 4 years increasing by Rs.2000 per year in
replaced? the fifth and subsequent years. If money is worth 10%, when the
Assume
scrap value = 0.
I II III IV V VI VII
I -1 3 -1 4 2 2 -5
II -3 5 6 1 2 2 0
X1,x2 ≥ 0
20 ) Solve the following L.P.P by dynamic programing method
Maximize Z = Zx1 + 5x2
Subject to Zx1 + x2 ≤430
Zx2 ≤460 21) A manual stamper
current valued at Rs
1,000 will last 2 years and cost Rs 4,000 per
year to operate. An automatic stamper which can be purchased for Rs 3,000 will last 4 years and can be
operated at an annual cost of Rs 3,000. If money carries the rate of interest 10% per annum, determine
which stamper should be purchased.
22)A truck owner finds from his past records that the maintenance cost
Per year of a truck whose purchase price is Rs.8000, are given below.
Year 1 2 3 4 5 6 7 8
Maintenance cost1000 1300 1700 2200 2900 3800 4800 6000
(Rs.)
Resale value (Rs.)4000 2000 1200 600 500 400 400 400
Determine at what time it is profitable to replace the truck.
23 ) Briefly explain the types of failure.
24 ) Solve the following game using dominance property.
Player Player B
A B1 B2 B3
A1 1 7 2
A2 6 2 7
A3 5 2 6
Job 1 2 3 4 5 6
Machine A 12 10 9 14 7 9
Machine B 7 6 6 5 4 4
Machine c 6 5 6 4 2 4
X1,X2≥0
27 Use dynamic programing ,solve the following LPP,
Maximize Z = x1+9x2
Subject
28 ) Machine A costs Rs 6000. to theoperating
Annual constraints,
costs are Rs 400 for the first year and then increase by
Zx1 + that
Rs 2000 every year. Assuming x2 ≤ machine
9 x2 A has no resale value, determine that best replacement
age. Another machine B,Subject
which istosimilar
the constraints
to machine , A, costs Rs 4000. Annual running costs are Rs 200
Zx1 + X
for the first year then increase by2 ≤
Rs252000 every year. It has resale value of Rs 1,500, Rs 1,000 and Rs
500 if replaced at end of X 2 ≤first,
the 11 second, third years, respectively. It has no resale value from the
fourth year onwards.
i) Which machine would you prefer to purchase?
ii) Future costs are not to be discounted.
29 )An individual is planning to purchase a car will cost Rs.1, 20,000. The resale value of
the car at the end of the year is 85% of the previous year value. Maintenance and
operation costs during the first year are Rs. 20,000 and they increase by 15% every year.
The minimum resale value of car can be Rs.40, 000.
i) When should the car be replaced to minimize average annual cost (ignore initial)?
30 ) In a game of matching coins, player A wins Rs 8 when both the coins show head and
Re 1 when both are tails. B wins Rs 3 when the coins do not match. Given the choice of
being matching player A or B which one would you choose and what would be your
strategy?
31)
i) Explain briefly the main characteristics of queuing system.
ii)What are the applications of dynamic programming?
32)The following failure rates have been observed for a certain type of 1000
light bulbs:
End of week 1 2 3 4 5 6 7 8
Probability of failure 0.05 0.13 0.25 0.43 0.68 0.88 0.96 1.00
33) The cost of replacing an individual failed 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.
i) What is the best interval between group replacements?
ii) At what group replacement price per bulb would a policy of
strictly individual replacement become preferable to the adopted
policy?
34) A medical representative located at city 1 has to travel to city 10. He known the distance of
alternative routes city 1 to city 10 and has network map based on the distance between the cities as in
the following table. Draw the network and find the shortest possible routes. Also, find the shortest
routes from any city to city 10
35) Assume that present value of one rupee to be spent in a year’s time is Rs.0.90 and C = Rs.
3000 capital equipment and the running costs are
given in the table below
Year 1 2 3 4 5 6 7
Running cost (Rs.) 500 600 800 1000 1300 1600 2000
i) When should the machine be replaced?
The maintenance cost and resale value per year of a machine whose
purchase price is Rs.7,000 is given below:
Year 1 2 3 4 5 6 7 8
Maintenance 900 1200 1600 2100 2800 3700 4700 5900
Cost (Rs.)
Resale value 4000 2000 1200 600 500 400 400 400
(Rs.)
ii) When should the machine be replaced?
39 ) A Distance network contains of 11 nodes which are distributed as shown in figure . table the
shortest [path from node 1 to node 11 and also the corresponding distances.
40)Use dominance property to reduce the game to 2 x 2 game and hence find the
optimal strategies.
Player B
5 −10 9 0
Player A
( 6 7
8 7 15
8
12 4 −1
1
1
4
)