LOYOLA COLLEGE (AUTONOMOUS), CHENNAI – 600 034      B.A. DEGREE EXAMINATION – ECONOMICS

AB 03

THIRD SEMESTER – NOV 2006

        ST 3100 – RESOURCE MANAGEMENT TECHNIQUES

(Also equivalent to STA 100)

 

 

Date & Time : 28-10-2006/9.00-12.00      Dept. No.                                                       Max. : 100 Marks

 

 

PART – A

Answer all questions.                                                                 (10 x 2 = 20 Marks)

 

1. Define slack and surplus variables.
2. Explain linear programming problem.
3. When do you say that a transportation problem is unbalanced? How to make it balanced?
4. Express a transportation problem as a linear programming problem.
5. What is the objective of a sequencing problem?
6. Write any two uses of an assignment problem.
7. State any two differences between CPM and PERT.
8. Define: a) Network             b) Activity
9. What are the components of a cost function in an inventory model?
10. Define: i) Optimistic time            ii) Pessimistic Time

 

 

PART – B

Answer any Five questions.                                                       (5 x 8 = 40 Marks)

 

11. A firm manufacturers two products A and B on which the profit earned per unit are Rs.3 and Rs.4 respectively. Each product is processed on two machines M₁ and M₂ product A requires one minute of processing time on M₁ and 2 minutes on M₂ while B requires one minute on M₁ and one minute on M₂.  Machine M1 is available for not more them 7 hours and 30 minutes, while machine M₂ is available for 10 hours during any working day.  Formulate the problem as a linear programming problem.
12. Find all the basic solutions to the following system of linear equations:

x₁ + 2x₂ + x₃  =  4

2x₁ + x₂ + 5x₃  =  5

 

13. Obtain the initial basic feasible solution for the following transportation problem using north-west corner method.

D₁        D₂        D₃        D₄        D₅        D₆    Supply

 

O₁        6         4          8         4          9         6         4

O₂        6         7          13        6          8         12        5

O₃        3         9          4         5          9         13        3

O₄        10        7          11        6          11        10        9

Demand          4         4          5          3          2         3

 

 

 

14. Four professors are capable of teaching any one of 4 different courses. Class preparation time in hours for different topics varies from professor to professor and is given in the table below.  Each professor is assigned only one course.  Determine an assignment schedule so as to minimize the total course preparation time for all courses.

 

Professor       Subject 1          Subject 2         Subject 3         Subject 4

A                     2                    10                     9                     7

B                     15                    4                      14                    8

C                     13                   14                     16                    11

D                     4                    15                     13                    9

 

15. Determine the optimal sequences of jobs that minimizes the total elapsed

time based on the following processing time on machines given in

hours and passing is not allowed.

 

Job

1          2          3         4          5

A    3          8          7         5          2

Machine   B     3          4          2         1          5

C    5          8          10        7          6

 

16. Draw the network and find the critical path for the project comprising of 9 activities

 

Activity              A         B         C         D         E          F          G         H         I

 

Immediate

Predecessor      __        __        __        A         B         C         D, E     B         H, F

 

Estimated time

(weeks)              3          5          4          2          3          9          8          7          9

 

17. Explain ABC Analysis in inventory control.

 

18. Neon lights in a campus are replaced at the rate of 100 units per day. The physical plant orders the neon lights periodically.  It costs Rs.100 to initiate a purchase order.  A neon light kept in storage is estimated to cost about Rs.2 per day.  The lead-time between placing and receiving an order is 12 days.  Determine the optimal inventory policy for ordering the neon lights.

 

PART – C

Answer any Two questions.                                                       (2 x 20 = 40 Marks)

 

19. Use simplex method to

Maximize  Z = 3x₁ + 2x₂ + 5x₃

Subject to

x₁ + 2x₂ + x₃  £ 430

3x₁ + 2x₃  £  460

x₁ + 4x₃  £ 420

x₁, x₂, x₃  ³ 0

20. A manufacturer has distribution centers at X, Y and Z. These centers have availability 40, 20 and 40 units respectively of his product.  His retail outlets at A, B, C, D and E requires 25, 10, 20 30 and 15 units respectively.  The transport cost (in rupees) per unit between each centers and outlet is given below.

Retail outlet

Distribution centre         A        B          C       D        E

X                     55        30        40       50        50

Y                     35        30        100      45        60

Z                      40        60        95        35        30

 

Determine the optimal distribution to minimize the cost of transportation.

 

21. A project is composed of 11 activities. The time estimates (in days) for which are given below:

Activity           Optimistic time           Pessimistic time           Most likely time

(1, 2)                            7                                 17                                9

(1, 3)                            10                                60                                20

(1, 4)                            5                                 15                                10

(2, 5)                            50                              110                                65

(2, 6)                            30                                50                                40

(3, 6)                            50                                90                                55

(3, 7)                            1                                 9                                 5

(4, 7)                            40                                68                                48

(5, 8)                            5                                 15                                10

(6, 8)                            20                                52                                27

(7, 8)                            30                                50                                40

 

• Draw the network diagram for the project.

1. Find the expected value and variance for each activity.

• Find the critical path.

1. Find the total float and free float for each activity.

• What is the probability of completing the project in 125 days?

22. Explain in detail a single item static inventory model with one price break with suitable diagrams.

Go To Main Page

Latest Govt Job & Exam Updates:

View Full List ...