Assignment 5 PDF
Assignment 5 PDF
1. Describe the systematic approach to the equipment replacement programme. State the advantages of
sound equipment replacement programme.
2. Describe the following replacement policies,
(i) Replacement policy for items when money value remains constant.
(ii) Replacement policy for items when money value changes with constant rate during the period.
3. A machine owner finds from his past records that the cost per year of maintaining a machine whose
purchase price is Rs. 6000 are given below,
Year 1 2 3 4 5 6 7 8
Maintenance 1000 1200 1400 1800 2300 2800 3400 4000
Cost
Resale 3000 1500 750 375 200 200 200 200
Price
Determine at what age a replacement is due.
4. (i) Machine A costs Rs. 9000. Annual operating costs are Rs. 200 for the first year, and then increases
by Rs. 2000 every year. Determine the best age to replace the machine. If the optimum replacement
policy is followed, what will be the average yearly cost of owning and operating the machine?
(ii) Machine B costs Rs. 10000. Annual operating costs are Rs. 400 for the first year and then increases by
Rs.800 every year. You now have a machine of type A which is one year old. Should you replace it with
B, if so, when?
5. Write short notes on
(i) Individual replacement
(ii) Group replacement
(iii) Deteriorating items and sudden failure items
(iv) MAPI method
6. A computer contains 10000 resisters. When any resister fails, it is replaced. The cost of replacing a
resister individually is Rs. 1 only. If all the resisters are replaced at the same time, the cost per resister
would be reduced to 35 paise. The percent surviving at the end of month 't' is given below,
Month→ 0 1 2 3 4 5 6
% surviving at the 100 97 90 70 30 15 0
End of the month (St)
What is the optimum replacement plan?
7. Describe various inventory models. Explain briefly the following terms:
(i) Purchase cost (ii) Ordering cost (iii) Inventory carrying cost (iv) Shortage cost
8. Derive a formula for economic order quantity (EOQ) for an inventory model with uniform
demand.
9. A company requires 16000 units of raw material costing Rs. 2 per unit. The cost of placing an
order is Rs.45 and the carrying costs are 10% per year per unit of the average inventory.
determine,
(i) the economic order quantity
(ii) cycle time
(iii) total variable cost of managing the inventory.
10. A particular item has a demand of 9000 units/year. The cost of one procurement is Rs.100 and
the holding cost per unit is Rs. 2.40 per year. The replacement is instantaneous and no shortages
are allowed. determine,
(i) the economic lot size
(ii) the number of orders per year
(iii) the time between orders
(iv) the total cost per year if the cost of one unit is Rs.1.
11. A company has a demand of 12000 units/year for an item and it can produce 2000 such
items per month. The cost of one setup is Rs. 400 and the holding cost/unit/month is Rs.0.15.
Find the optimum lot size and the total cost per year, assuming the cost of 1 unit as Rs.4. Also
find the maximum inventory, manufacturing time and total time.
12. A firm uses every year 12000 units of raw material costing Rs.1.25 per unit. Ordering cost
is Rs.15 per order and the holding cost is 5% per year of average inventory. Find,
(i) the economic order quantity
(ii) The firm follows EOQ purchasing policy. It operates for 300 days per year. Procurement
time is 14 days and safety stock is 400 units. Find the re-order point, the maximum inventory
and the average inventory.
13. The demand for an item is deterministic and constant over time and it is equal to 600 units
per year. The per unit cost of the item is Rs. 50 while the cost of placing an order is Rs.5. The
inventory carrying cost is 20% of the cost of inventory per annum and the cost of shortage is
Rs.1per unit per month. Find the optimal ordering quantity and when stock outs are permitted.
If the stock outs are not permitted, what would be the loss to the company?
14. What is dynamic programming? State the Bellman’s “principle of optimality” in dynamic
programming and give mathematical formulation of D.P.
15. Use dynamic programming to find the maximum value of
Maximize Z = 𝑥1 . 𝑥2 … … 𝑥𝑛
Subject to constraints: 𝑥1 + 𝑥2 + ⋯ + 𝑥𝑛 = 𝐶 𝑎𝑛𝑑 𝑥1 , 𝑥2 , … , 𝑥𝑛 ≥ 0
16. Use dynamic programming to solve the following problem.
Minimize Z = 𝑦12 + 𝑦22 + 𝑦32
Subject to constraints: 𝑦1 + 𝑦2 + 𝑦3 ≥ 15 𝑎𝑛𝑑 𝑦1 , 𝑦2 , 𝑦3 ≥ 0
𝑀𝑎𝑥 𝑧 = 𝑥1 + 9𝑥2
Subject to the constraints:
2𝑥1 + 𝑥2 ≤ 25
𝑥2 ≤ 11
𝑥1 , 𝑥2 ≥ 0