MSC 521 Introduction to Operations Research

1. (25 pts) Figure 1 illustrates an undirected network (any path or arc may be traversed in any direction and/or number of times). Find the shortest route through the undirected network in Figure 1 from the Start node (S) to the End node Terminal (T) using any algorithm or method of interest. Points in the network are called nodes (S, A, B, C, D, E and T). Lines in a network are called arcs (SA, SB, SC, AC, etc). Numbers are distances in miles.

Figure 1. Network diagram for Problem #1. Select the most appropriate feasible answer from the following choices in Table 1. Table 1. Possible choices for question 1.

Possible Answers
1)
From S S S A A B B C C C C C D D D E E E Total Distance 28 To A B C C D C E A B D E T A C T B C T From S S S A A B B C C C C C D D D E E E 13

2)
To A B C C D C E A B D E T A C T B C T From S S S A A B B C C C C C D D D E E E

3)
To A B C C D C E A B D E T A C T B C T 11

4)

Neither choice 1), 2), nor 3)

Most appropriate Answer from Table 1above: Choice no 3 By Dijkstra's

of 11.

Page 1 of 5

MSC 521 Introduction to Operations Research

2. (35 pts)

Formulate the following problem as a mixed integer program (do NOT solve). A Company manufactures n different products having unit profits of Pi ( i = 1,2, ...., n). Each product can be manufactured on any of m available machines. The length of time in minutes it takes to manufacture one unit of product i on machine j is tij. If machine j is to be used on a particular shift, a setup time in minutes of sj is incurred. During a normal 8 hour shift, R i ( i = 1,2, ...., n), SOME units of product i must be manufactured. There are k operators (k<m) available to operate machines on a given shift (i.e. no more than k machines can operate on a shift). Because of a shared power source, Machine 2 can be used only if machine 1 is being used. Machines 3 and 4 share the same drive system, and therefore they cannot both operate on the same shift. To operate machines 5 or 6 will require an additional cost of c dollars each per shift because of their unique power requirements. The objective is to determine for a given shift, which machines to operate and how many units of each product to manufacture on each machine in order to maximize profit. Assume no machine downtime during a shift (i.e. each machine is available for 8 hours). Let:

n Pi tij K Ri m sj
Caveats:

= = = = = = =

number of different products (discrete integer) unit of profit (continuous), i = 1 to n (discrete integer) time to produce one unit of product i on machine j (continuous, min) workers available per shift (less than # of machines available) time available per shift (8 hr assumed) i = 1 to n (discrete integer) number of available machines (discrete integer) set up time on machine j (continuous, min)

Machine 2 & 1 related (dependent): Machine 2 ONLY if Machine 1 Machine 3 & 4 related (dependent): Machine 3 OR Machine 4 Machine 5 & 6 penalty (cost): $c/shift
a. Define your continuous (xij ) and integer variables (yj ):

xij
yj

# of units of product i (i=1..n) to manufacture on machine j (j=1m) 1 if machine j used, else = 0 (binary flag)

--------------------- --------------------- ---- OVER ---------------------------

Page 2 of 5

MSC 521 Introduction to Operations Research

Select from the following choices in Table 2 the most appropriate formulation.
Table 2. Possible choices for question 2.
Possible Choices

1)
]

2)
]

3)
]

= [
=1 =1

(4 + 5 )

= [
=1 =1

(5 + 6 )

= [
=1

(5 + 6 )

4) Neither choice 1), nor choice 2), nor choice 3) are correct

Subject To: yj 1 (machine flag 0 OR 1) y3 +y4 1 (machine 3 OR 4) y2 y1 (machine 2 AFTER machine 1) xij 0 (non-negativity) =1 K (machine availability limit)
Ri (machine usage =1 limit/shift), i = 1,,n 8 *60 (time limit =1 + for shift), j = 1,,m

Subject To: yj 1 (machine flag 0 OR 1) y3 +y4 1 (machine 3 OR 4) y2 y1 (machine 2 AFTER machine 1) xij 0 (non-negativity) =1 K (machine availability limit)
=1 Ri (machine usage limit/shift), i = 1,,n 8 *60 (time limit =1 + for shift), j = 1,,m

Subject To: yj 1 (machine flag 0 OR 1) y3 +y4 1 (machine 3 OR 4) y2 y1 (machine 2 AFTER machine 1) xij (non-negativity) =1 K (machine availability limit)
=1 Ri (machine usage limit/shift), i = 1,,n =1 + 8 *60 (time limit for shift), j = 1,,m

Most appropriate Answer from Table 2 above: Choice no (4)

Possible correction on the model: * machine 2 can be used only if machine 1 is used can be modeled by: y1=y2 *Non-negativity constraint for xij is modeled by xij0 *Machine usage limit/shift constraint is modeled as:

Page 3 of 5

MSC 521 Introduction to Operations Research

3) (40 pts) Monthly demands given in Table 3. Holding cost for this item is $X per month per item and order (setup)

cost is $Y per order. No backorders are permitted. A total of exactly N items must be ordered over the 12 month planning horizon. X = $2/mo/item; Y = $1,000/order; N = 1362 Table 3. Monthly demands for question 2.
Month Forecasted Demands Jan 75 Feb 95 Mar 83 Apr 112 May 145 Jun 156 Jul 120 Aug 81 Sep 137 Oct 92 Nov 112 Dec 135

The order quantity types in Table 4 are to be considered.

Table 4. Order quantity types. Type EOQ Fixed Period with m = 3 Lot for Lot Silver Meal Wagner - Whitin

Note: EOQ is strictly applicable to uniform demand, so use monthly demand as well as optimal order period based on aggregate yearly average. Determine the order quantities and total cost for each method in Table 4, then select the most appropriate answer from the choices in Table 5. Select from the following choices in Table 5 on the next page the most appropriate answer for each order type from Table 4.
------------------------------------- OVER ---------------------------------------The solution
Month EOQ Fixed Period with m =3 Lot for Lot Silver Meal Wagner Whitin Jan 335 Feb 0 Mar 0 Apr 335 May 0 Jun 0 Jul 335 Aug 0 Sep 0 Oct 335 Nov 0 Dec 335 Total Cost $9,084.00

253

413

338

339

$6,910.00

75

95

83

112

145

156

120

81

137

92

112

135

$12,000.00

253

413

430

247

$6968

253

257

357

476

$6,818.00

Page 4 of 5

MSC 521 Introduction to Operations Research Table 5. Order Quantity Choices. Choice 1:
Month EOQ Fixed Period with m =3 Lot for Lot Silver Meal Wagner Whitin Jan 335 Feb Mar Apr 335 May Jun Jul 335 Aug Sep Oct 335 Nov Dec 335 Total Cost $8,420.00

253

413

338

339

$6,910.00

75

95

83

112

145

156

120

81

137

92

112

135

$12,000.00

253

413

430

247

$6,968.00

253

257

357

476

$6,818.00

Choice 2:
Month EOQ Fixed Period with m =3 Lot for Lot Silver Meal Wagner Whitin Jan 320 Feb Mar Apr 320 May Jun Jul 320 Aug Sep Oct 320 Nov Dec 320 Total Cost $8,150.00

412

150

338

339

$7,980.00

75

95

83

112

145

156

120

81

137

92

112

135

$12,000.00

253

413

430

247

$6,968.00

253

257

357

476

$6,818.00

Answer: Place a check next to the most appropriate choice: a) Choice 1 is the most appropriate/consistent with the given information __________ b) Choice 2 is the most appropriate/consistent with the given information __________ c) Neither Choice 1 nor Choice 2 are appropriate/consistent given the information __________

Page 5 of 5