LOYOLA COLLEGE (AUTONOMOUS), CHENNAI – 600 034

M.Sc. DEGREE EXAMINATION – STATISTICS

FOURTH SEMESTER – APRIL 2012

ST 4811 – ADVANCED OPERATIONS RESEARCH

 

 

Date : 20-04-2012             Dept. No.                                        Max. : 100 Marks

Time : 1:00 – 4:00

 

PART-A

Answer all the following:                                                                                                            (10X2=20)

 

1. When is a solution to an LPP called infeasible?
2. Define Pure Integer Programming Problem.
3. Define holding costs.
4. Write down the basic components of a queuing model.
5. Write down the significance of integer programming problem.
6. What do you mean by Non Linear Programming Problem?
7. Define Dynamic Programming Problems.
8. Define Stochastic programming.
9. Provide any two applications for parallel and sequence service systems.
10. An oil engine manufacturer purchases lubricants at the rate of Rs.42 per piece from a vendor.

The requirement of these lubricants is 1,800 per year. What should be the order quantity per

order, if the cost per placement of an order is Rs.16 and inventory carrying charge per rupee per

year is only 20 paise.

 

PART  B

Answer any FIVE of the following:                                                                                       (5 X 8 = 40)

 

11) Use the graphical method to solve the following LPP:

Minimize Z = x₁ + 0.5x₂

Subject to the constraints:

3x₁ +  2x₂ ≤ 12 , 5x₁≤ 10  x₁+ x₂ ≥ 8 , – x₁+ x₂ ≥ 4 ,  x₁≥ 0 and x₂ ≥ 0.

• Write down the simplex algorithm.
• Use duality to solve the following LPP:

Maximize Z = 2x₁ + x₂

Subject to the constraints:

x₁ + 2x₂ ≤ 10  ,   x₁ + x₂ ≤ 6 ,  x₁ – x₂ ≤ 2 , x₁ – 2x­₂ ≤ 1 ; x₁,x₂ ≥ 0 .

• Write briefly about inventory management.
• Explain Branch and Bound model for solving interger programming problem.
• Write Wolfe’s algorithm to solve Quadratic Programming Problem.
• Solve the following NLPP using lagrangian multiplier principle:

Z =  x² + y² + z²

Subject to the constraints:  x + y + z = 1 , x, y , z ≥ 0

• Explain the scope of simulation and its applications.

 

 

 

 

PART – C

 Answer any two questions:                                                                                             (2x 20 = 40)

 

19.(a) Use two-phase simplex method to

Maximize Z =  5x₁ – 4x₂ + 3x₃

Subject to the constraints:

2x₁ + x₂ -6x₃ = 20 , 6x₁ + 5x₂ + 10x₃ ≤ 76 , 8x₁ – 3x₂ +6x₃ ≤ 50 ; x₁, x₂, x₃  ≥ 0

(b) Explain the characteristics of dynamic programming problem.             (12 + 8 )

 

20) Solve the following integer programming problem using Gomory’s constraints method:

Maximise Z = 7x₁+ 9x₂

Subject to –x₁ + 3x₂ ≤ 6, 7x­₁+ x₂ ≤ 35, x₁ is a n integer and x₂ ≥ 0

(20)

21)   Use Wolfe’s method to solve the following QPP:

Maximize Z = 4x₁ + 6x₂ – 2x₁x₂ – 2x₁² – 2x₂²

Subject to the constraints:

x₁ + 2x₂ ≤ 2  ; x₁, x₂ ≥ 0 .                                                                     (20)

 

22) a) Derive the steady state differential equation for the model (M/M/1) : (GD/. (12)

 

1. b) The rate of arrival of customers at a public telephone booth follows Poisson distribution,

with an average time of 10 minutes between one customer and the next. The duration of a

phone call is assumed to follow exponential distribution, with mean time of 3 minutes.

• What is the probability that a person arriving at the booth will have to wait?
• What is the average length of the non-empty queues that form from time to time?
• The Steve Telephone Nigam Ltd. will install a second booth when it is convinced that the customer would expect waiting for atleast 3 minutes for their turn to make a call. By how much time should the flow of customers increase in order to justify a second booth?
• Estimate the fraction of a day that the phone will be in use.    (8)

 

 

Go To Main Page

 

 

 

Latest Govt Job & Exam Updates:

View Full List ...