1. © Copyright Andrew Hall, 2002 FOMGT 353 Introduction to Management Science Lecture 17l. Slide 1 Network Models Lecture 17 (Part l.) The Least Cost Starting Procedure

2. © Copyright Andrew Hall, 2002 FOMGT 353 Introduction to Management Science Lecture 17l. Slide 2 The Least Cost Starting Procedure 1.Starting with the least expensive Flow, we fill in as much flow for that Decision Variable, Xij, as possible. 2.Adjust the Border Demands and Supplies to take into account the Flow allocated. If there is still a positive amount of Border Demand, goto 3, otherwise stop. 3.Move to the next least expensive Flow and fill in as much flow for that Decision Variable, Xij, as possible. 4.Goto 2.

3. © Copyright Andrew Hall, 2002 FOMGT 353 Introduction to Management Science Lecture 17l. Slide 3 Least Cost 1 0 15,000 In x21, insert the min of S2 and D1 Subtract x21 from S2 and from D1.

4. © Copyright Andrew Hall, 2002 FOMGT 353 Introduction to Management Science Lecture 17l. Slide 4 Least Cost 2 In x31, insert the min of S3 and D1 Subtract x31 from S3 and from D1. 10000 0

5. © Copyright Andrew Hall, 2002 FOMGT 353 Introduction to Management Science Lecture 17l. Slide 5 Least Cost 3 In x11, insert the min of S1 and D1

6. © Copyright Andrew Hall, 2002 FOMGT 353 Introduction to Management Science Lecture 17l. Slide 6 Least Cost 4 In x32, insert the min of S3 and D2 0 Subtract x32 from S3 and from D2. 10000

7. © Copyright Andrew Hall, 2002 FOMGT 353 Introduction to Management Science Lecture 17l. Slide 7 Least Cost 5 In x22, insert the min of S2 and D2

8. © Copyright Andrew Hall, 2002 FOMGT 353 Introduction to Management Science Lecture 17l. Slide 8 Least Cost 6 In x12, insert the min of S1 and D2 Subtract x12 from S1 and from D2. 0 10000

9. © Copyright Andrew Hall, 2002 FOMGT 353 Introduction to Management Science Lecture 17l. Slide 9 Least Cost Initial Feasible Solution