1
LOYOLA COLLEGE (AUTONOMOUS), CHENNAI 600 034
B.A.DEGREE EXAMINATION -ECONOMICS
FOURTH SEMESTER APRIL 2018
16UEC4ES01- OPERATIONS RESEARCH
Date: 23-04-2018 Dept. No. Max. 100 Marks
Time: 09:00-12:00
PART-A
Answersany FIVEquestionsinabout75wordseach x 4 20 Marks)
1. Pointout the variousmethodsoftransportationproblem.
2. Whatare the differentformsofinventory?
3. Listout the uses ofoperationsresearch.
4. Distinguish between PERTandCPM.
5. Definebasicfeasible solution in a LinearProgramming Problem.
6. Writea shortnoteon EconomicOrderQuantity (EOQ).
7. State the role ofslack variables and surplusvariablesinaLinearProgramming Problem.
PART-B
Answerany FOURquestionsinabout250 wordseach x 10 40 marks)
8. Briefly explain the costsinvolved in inventory problems.
9. Analyse the role ofoperationsResearch in Businessandmanagementandengineering.
10. Explainthe stepsinvolved in the Hungarian method usedforsolvingassignmentproblems.
11. Solve the transportation model using NWCM
D
E
F
G
Available
A
11
13
17
14
250
B
16
18
14
10
300
C
21
24
13
10
400
Requirements
200
225
275
250
12. Acompany produces refrigeratorsinunitI and heatersinunitII.The twoproductsare produced. The weekly production cannot exceed 25inunitI and 36inunitII, Due toconstraints toworkersareemployed.Arefrigeratorrequires 2men-week oflabour, while a heater requires 1man-week oflabour. The profitavailable isRs.600per refrigeratorandRs.400per heater. Formulate the LPPproblem.
I
II
III
IV
A
10
5
13
15
B
3
9
18
3
C
10
7
3
2
D
5
11
9
7
p
Q
R
S
A
51
53
54
50
B
47
50
48
50
c
49
50
60
61
D
63
64
60
60
13. The assignmentcostofassigningany one operatortoany onemachine isgiven inthe followingtable:
Operators
Machines
Find the optimalassignmentby Hungarian method.
14. The annual demandfora productis 1,00,000units. Therateofproduction is 2,00,000unitsper year. The set-upcostperproduction runisRs.5000, andthe variableproduction costofeach item isRs,10. The annualholdingcostperunitis 20%ofthe value ofthe unit. Find the optimum production lot-size,and the length ofthe production run.
PART-C
Answerany TWO questionsinabout900wordseach x 20 40 marks)
15. Solve the assignmentproblem formaximization given theprofitmatrix(profitinRs)
Machines
Jobs
1
16. Find the sequence thatminimizes the totalelapsed timerequired tocomplete the following tasks
Task
A
B
C
D
E
F
G
Machine 1
3
8
7
4
9
8
7
Machine 2
4
3
2
5
1
4
3
Machine 3
6
7
5
11
5
6
12
17. Analyse the rules forconstructingnode andnetwork computations.
18. Solve the transportation problem by Vogel's Approximation method.
Destination
Source

A
B
C
D
SUPPLY
1
11
20
7
8
50
2
21
16
20
12
40
3
8
12
18
9
70
DEMAND
30
25
35
40