8 Register Number :

(i) What is the reliability ? Name of the Candidate :

(ii) What is the probability of failure if it 5212

is designed in a group redundant
B.Sc. DEGREE EXAMINATION, 2010
manner in which each group consists of
10 elements ? ( MATHEMATICS )

(iii)What is the reliability improvement ( THIRD YEAR )

factor ? ( PART - III )

( PAPER - VII )

740. OPERATIONS RESEARCH

( Including Lateral Entry )

December ] [ Time : 3 Hours

Maximum : 100 Marks

Answer any FIVE questions.

All questions carry equal marks.

(5 20 = 100)

1. (a) A company makes two varieties, Alpha and

beta of pens. Each alpha pen needs twice
as much labour time as a Beta pen. If only
Beta pens are manufactured, the company

Turn Over
 2 7

can make 500 pens per day. The market

Year 1 2 3 4 5
can take only up to 150 alpha pens and
Resale
250 beta pens per day. If alpha and beta
value
pens yield profits of Rs.8 and Rs.5
(Rs.) 42,000 30,000 20,400 14,400 9,650
respectively per pen, formulate this as a
Cost
linear programming problem.
of spares
(b) Using graph, find the minimum value of (Rs.) 4,000 4,270 4,880 5,700 6,800
Cost
z = 20x 1 + 10x 2
of labour
subject to the constraints (Rs.) 14,000 16,000 18,000 21,000 25,000

x + x 40, Determine the optimum period for replacement

1 2
of the machine.
3x + x2 30,
1
10. (a) Define :
4x 1 + 3x 2 60,
(i) Mean time between failures.
x 1 , x 2 0.
(ii) Failure rate.
2 (a) Obtain all the basic feasible solutions of the
following system of linear equations : (iii) System Reliability.

x 1 + 2x 2 + x 3 = 4 (b) A system consists of 5,000 elements each

having MTBF of 1,00,000 hours. Its
2x 1 + x 2 + 5x 3 = 5
cumulative operating time is 10 hours.

Turn Over
 4 5

4. (a) Obtain the dual problem of the following D1 D2 D3 D4 Supply

primal problem :
S1 3 7 6 4 5
Minimize z = x 1 3x 2 2x3
S2 2 4 3 2 2
subject to the constraints
S3 4 3 8 5 3
3x 1 x 2 + 2x 3 7
Demand 3 3 2 2
2x 4x 12
1 2 6. (a) E x p l a i n t h e d i f f e r e n c e b e t w e e n a
4x + 3x + 8x = 10 transportation problem and an assignment
1 2 3
problem.
x 1, x 2 0
(b) Solve the following assignment problem :
and x 3 is unrestricted.
I II III IV V
(b) Use dual simplex method to solve the linear
programming problem : 1 3 8 2 10 3

Minimize z = x1 + x2 2 8 7 2 9 7

subject to the constraints 3 6 4 2 7 5

2x 1 + x 2 4 4 8 4 2 3 5

x 1 + 7x 2 7 5 9 10 6 9 10

x 1 , x 2 0. 7. We have 4 jobs each of which has to go

through the machines Mj (j = 1, 2, , 6) in
(5) Find the starting solution in the following
the order M1, M2, , M6. Processing time
transportation problem by Vogels approximation
(in hours) is given below :
method. Also, obtain the optimum solution :
Turn Over
 6 3

Machines (b) Use simplex method to solve the following

LPP :
M1 M2 M3 M4 M5 M6
Job-A 10 8 7 2 10 25 Maximize z = 4x 1 + 10x 2

Job-B 17 6 9 6 8 19 subject to the constraints

Job-C 11 5 8 5 7 15 2x 1 + x 2 50,
Job-D 20 4 3 4 8 12 2x 1 + 5x 2 100,
Determine a sequence of these four jobs that 2x + 3x 90;
1 2
minimizes the total elapsed time.
x 1, x 2 0.
8. (a) D e r i v e t h e E O Q f o r m u l a f o r t h e
manufacturing model without shortages. 3. Use two-phase simplex method to maximize

(b) An item is produced at the rate of 50 items z = 5x 1 4x 2 + 3x 3

per day. The demand occurs at the rate of
25 items per day. If the set-up cost is subject to the constraints
Rs.10000 and holding cost is Re.001 per
2x 1 + x 2 6x 3 = 20
unit of item per day, find the economic lot
size for one run, assuming that the 6x 1 + 5x 2 + 10x 3 76
shortages are not permitted. Also find the
time of cycle and minimum total cost for 8x 1 3x 2 + 6x 3 50
one run. x 1 , x 2 , x 3 0.
9. (a) Discuss the various types of replacement
situations.

(b) The data collected in running a machine, the

cost of which is Rs.60,000 are given below: Turn Over