Register Number
SATHYABAMA UNIVERSITY
(Established under section 3 of UGC Act,1956)
Course & Branch :B.Tech - P-CHEM
Title of the Paper :Resource Management Techniques Max. Marks:80
Sub. Code :619PT401(2008-09-10)
Time : 3 Hours
Date :02/05/2012
Session :AN
______________________________________________________________________________________________________________________
1.
PART - A
(10 x 2 = 20)
Answer ALL the Questions
What are the features operation research techniques?
2.
What do you mean by decision variable?
3.
What are pure and mixed integer programming problem?
4.
State balanced transportation problem.
5.
Write HUNGARIAN algorithm.
6.
What do you mean by EOQ? State the formulae.
7.
What are idle times?
8.
Differentiate PERT and CPM.
9.
What are the types of replacement problem?
10. How an optimum replacement period is determined?
PART – B
(5 x 12 = 60)
Answer All the Questions
11. Define Model Building. Explain the steps involved in model
Building.
(or)
12. Solve by Two phase simplex method
Maximum
z = - 4x1-3x2-9x3
Subject to
2x1+4x2+6x3>=15
6x1+x2+6x3>=12
x1, x2, x3 >=0
13. Solve the following IPP in cutting plane algorithm method.
Maximize z = 200x1 + 300x2
Subject to
2x1+4x2 <=17
3x1+3x2 <= 15
x1, x2 >=0 and integer
(or)
14. Find the initial basic feasible solution for the following
transportation problem by VAM.
Destination
D1
D2
D3
D4
SUPPLY
Q1
11
13
17
14
250
Q2
16
18
14
10
300
Q3
21
24
13
10
400
Demand 200
225
275
250
950
15. Solve the following Assignment problem and obtain the
minimum cost at which all the jobs can be performed.
Job (Cost in ’00 Rs)
Worker 1
2
3
4
5
A
25 18 32 20 21
B
34 25 21 12 17
C
20 17 20 32 16
D
20 28 20 16 27
(or)
16. A hardware store procures and sells hardware items, information
on an item is given here:
Expected annual sale
= 8,000 units
Ordering cost
= Rs 180 per order
Holding cost
= 10% of the average inventory value
The item can be purchased according to the following schedule:
Lot size
unit Price (Rs)
1 – 999
22.00
1,000 – 1,499
20.00
1,500 – 1,999
19.00
2,000 and above
18.50
You are requested to determine the best order size.
17. You are given the following data regarding the processing times
of some jobs on three machines, I, II and III. The order
processing is I – II - III. Determine the sequence that minimizes
the total elapsed time (T) required to complete the jobs. Also
evaluate T and the idle time of II and III.
Processing Time (Hours)
Job
Machine
I
II
III
A
3
4
6
B
8
3
7
C
7
2
5
D
4
5
11
E
9
1
5
F
8
4
6
G
7
3
12
(or)
18. A small maintenance project consists of the following jobs whose
precedence relationship is given below.
Job
1-2 1-3 2-3 2-5 3-4 3-6 4-5 4-6 5-6 6-7
Duration (days) 15 15 3 5 8 12 1 14 3 14
(a) Draw an arrow diagram representing the project.
(b) Find the total float for each activity
(c) Find the critical path and the total project duration.
19. The data on the operating costs per year and resale prices of
equipment A whose purchase price is Rs. 10,000 are given here.
Year
1
2
3
4
5
6
7
Operating Cost (Rs) 1,500 1,900 2,300 2,900 3,600 4,500 5,500
Resale Value (Rs) 5,000 2,500 1,250 600 400 400 400
(a) What is the optimum period for replacement?
(b) When equipment A is 2 years old, equipment B, which is a
new model for the same usage, is available. The optimum period
for replacement is 4 years with an average cost of Rs. 3,600.
Should we change equipment A with that of B? If so, when?
(or)
20. A firm has a machine whose purchase price is Rs 20,000. Its
maintenance cost and resale price at the end of different years are
as given below.
Year
1
2
3
4
5
6
Maintenance Cost 1,500 1,700 2,000 2,500 3,500 5,500
Resale Price
17,000 15,300 14,000 12,000 8,000 3,000
(a) Obtain the economic life of the machine and the minimum
average cost.
(b) The firm has obtained a contract to supply the goods
produced by the machine, for a period of 5 years from now.
After this time period, the firm does not intend to use the
machine. If the firm has a machine of this type that is one year
old, what replacement policy should it adopt if it intends to
replace the machine not more than once?