IE5001

NATIONAL UNIVERSITY OF SINGAPORE FACULTY OF ENGINEERING EXAMINATION FOR Semester I: 2011-2012

IE5001 OPERATIONS PLANNING AND CONTROL I November 2011 Time Allowed: 2 hours

INSTRUCTIONS TO CANDIDATES: 1. This paper contains FIVE (5) questions and comprises FOUR (4) printed pages (cover page inclusive) 2. Answer ALL questions on the separate answer book provided 3. The total mark for the paper is 100. 4. This is an OPEN BOOK examination. 5. Programmable calculators are allowed for this exam.

2 Question 1 (25 marks) (a) The below simplex tableau is for a maximization linear programme.

IE5001

__________________________________________________________________________________________

z z-row 1 0 0 0

x1 a 1 1 3

x2 2 2 -4 3

x3 0 1 0 0

x4 0 0 1 0

x5 0 0 0 1

RHS 10 4 1 b

(i) Give conditions on a and b that make the current tableau optimal with only one optimal solution. What is the solution? (6 marks) (ii) Give conditions on a and b that make the current tableau has alternative optimal solutions. What is the optimal objective value, z*? (5 marks) (iii) If the problem is minimization instead of maximization, how would your answer to part (i) and (ii) change? (4 marks)

(b) An orange juice company can sell up to 15,000 tons of juice to wholesalers at $1500 per ton. The juice is either squeezed from oranges purchased at $200 per ton or diluted from concentrate obtained at $1600 per ton. In the warehouse, 10,000 tons of oranges are available and each ton yields 0.2 ton of juice. The supply of concentrate is unlimited, and each ton dilutes into 2 tons of juice. Formulate a linear programming model to advise how the company should produce the juice. (10 marks)

3 Question 2 (10 marks)

IE5001

__________________________________________________________________________________________

A swimming coach is choosing his team for a medley relay. In the relay, one swimmer will swim the back-stroke leg, one the breast-stroke leg, one the butterfly leg, and one the free-style leg. We denote the back-stroke leg as j = 1, the breaststroke leg as j = 2, butterfly leg as j = 3, and the free-style leg as j = 4. From previous experience, the coach knows the time tij, that swimmer i (where i = 1...4) could achieve on leg j. Using binary variables, formulate a model to help the coach choose his relay team. How would your model change if there are 5 swimmers?

Question 3 (15 marks) Each copy of magazine sells for $4 and cost $1. What are the opportunity cost of under-stocking an unit and the opportunity cost of over-stocking an unit of inventory? Given the following historical demands, determine how many magazines should the stall-owner stock. State the objective function and your assumption. Demand 0 1 2 3 4 5 6 7 8 Relative Frequency 5% 10% 15% 15% 15% 15% 10% 10% 5%

4 Question 4 (25 marks)

IE5001

__________________________________________________________________________________________

The below adajency matrix is a representation of a road network in kilometers. Suppose you live in location 1, what paths would you use to travel to the rest of the locations, and what are the distances? Suppose in future, an underground link shortens the distance between location 1 and location 4 by half, how will your solution change? Explain your reasoning. To from 1 2 3 4 1 0 15 25 35 2 15 0 8 40 3 25 8 0 20 4 35 40 20 0

Question 5 (25 marks) (a) How are queuing models used in practice, and what are the assumptions necessary for queuing models to be mathematically tractable? Suggest what you would do when the assumptions do not hold. (12 marks)

(b) We define the following notation : arrival rate/service rate. A: the event that there are n customers in the system, where n = 2, 3, 4, B: the event that a queue is formed. (i) In a M/M/1 system, how many customer is needed for a queue to be formed? (2 marks) (ii) For a M/M/1 system, write in terms of , the conditional probability that there are n customers (where n = 2, 3, 4,...), when a queue is formed, that is, P(A | B). (5 marks) [Hint: You may use the fact that P(A | B) = P(A intersect B)/P(B).] (iii) By taking expectation over the conditional probabilities, derive an expression for the expected number of customers in the queue of a M/M/1 system when a queue is formed. Does your expression simplify to 1/(1-)? (6 marks)

END OF PAPER