How To Exam?

a knowledge trading engine...


Annamalai University 2008-2nd Year B.Sc Mathematics " 640 OPERATIONS RESEARCH " ( - V ) ( PART - III ) ( ) 6675 - Question Paper

Wednesday, 13 March 2013 03:05Web



8

Rs. 100 per year in the sixth and the succeeding years. Assuming a 10 percent discount rate of money per year, find the optimum length of time to hold the machine before it is replaced.

(b) The demand of an item is uniform at a rate of 25 units per month. The fixed cost is Rs. 30 each time a production run is made. The production cost is Rs. 2 per unit and inventory carrying cost is Rs. 0-50 per unit per month. If the shortage cost is Rs. 3 per item per month, determine how often to make a production run and of what size ?

Name of the Candidate :

6 6 7 5 B.Sc. DEGREE EXAMINATION, 2008

(MATHEMATICS WITH COMPUTER APPLICATIONS) (SECOND YEAR)

(PART - III)

(PAPER - V)

640. OPERATIONS RESEARCH

December ]    [ Time : 3 Hours

Maximum : 100 Marks

8

PART - A (8 x 5 = 40)

Answer any EIGHT questions.

Each question carries FIVE marks.

1. A firm produces head - ache tablets in two sizes - A and B. Size - A contains 2 grains of aspirin, 5 grains of bicarbonate and 1 grain of codine. Size - B contains 1 grain of aspirin, 8 grains of bicarbonate and 6 grains of

Turn over

codine. It is found by users that it requires at least 12 grains of aspirin, 74 grains of bicarbonate and 24 grains of codine for providing immediate effect. It is required to determine the least number of tablets a patient should take to get immediate relief. Formulate the problem as a standard LPP.

2.    Solve the following problem graphically: Maximize

z = 3x1 + 2x2 Subject to the constraints :

xi - x2 < i ;

+ x2 > 3 ; xr x2 > 0.

3.    Define:

(i)    Standard L.P.P.

(ii)    Optimum solution.

(iii)    Surplus variable.

(iv)    Artificial variable.

Machine A B C D E

I

37

43

45

33

45

II

45

29

33

26

41

III

46

32

38

35

42

IV

27

43

46

41

41

V

34

38

45

40

44

(b) We have seven jobs each of which has to go through the machine M1 and M2 in order M M2 Processing times (in hours) are given as :

Job :

1

2

3

4

5

6

7

Machine M :

3

12

15

6

10

11

9

Machine M2 :

8

10

10

6

12

1

3

Determine a sequence of jobs that will minimize the total elapsed time T.

15. (a) A machine costs Rs. 10,000. Operating costs are Rs. 500 per year for the first five years. Operating costs increase by

12. Use dual simplex method to solve the following LPP :

Minimize

2x1 + 3x2

Subject to the constraints

2x1 + 3x2 < 30

xl + 2x2 > 10

xi - x2 > 0

x1 > 5, x2 > 0.

13. Determine an initial basic feasible solution to the following transportation problem using the row minimum method and hence, find the optimal solution:

To

ABC

I

5

3 22

II

9

4-5 17

III

25

20 5

40

20 20

Requirement

10

30 Availability 40

4.    Find the dual of the following LPP : Maximize

z = 40x + 50y Subject to constraints 2x + 3y < 3 4x + 2y < 2 ; x, y, > 0.

5.    Determine an initial basic feasible solution to the following transportation problem using (low cost method) matrix minimum method:

To


20 30

Available

15 13

40 6 8 18 6 Demand

6. Explain travelling salesman problem.

7.    Write down the optimal sequence algorithm for n jobs 2 machines.

8.    Find the economic lot size, the associated total cost, and the length of time between two orders, given that the setup cost is Rs. 100, the daily holding cost per unit of inventory is 5 paise and the daily demand is approximately 30 units.

9.    A truck owner finds from his past records that the maintenance cost per year of truck whose purchase price is Rs. 8,000 are as given below:

Year

Maintenance

cost

Resale

price

1

1,000

4,000

2

1,300

2,000

3

1,700

1,200

4

2,200

600

5

2,900

500

6

3,800

400

7

4,800

400

8

6,000

400

Determine at which it is profitable to replace the truck,

10.    Define reliability and give its important aspects.

PART - B (3 x 20 = 60)

Answer any THREE questions.

All questions carry equal marks.

11.    Solve the following L.P.P.

Maximize

z= 4x + 5x2 + 9x3 + llx4 Subject to the constraints

x + x2 + x3 + x4 < 15 7x1 + 5x2 + 3x3 + 2x4 < 120 3x1 + 5x2 + 10x3 + 15x4 < 100 xr x2, x3, x4 > 0.

Turn over







Attachment:

( 0 Votes )

Add comment


Security code
Refresh

Earning:   Approval pending.
You are here: PAPER Annamalai University 2008-2nd Year B.Sc Mathematics " 640 OPERATIONS RESEARCH " ( - V ) ( PART - III ) ( ) 6675 - Question Paper