90 likes | 239 Views
Network Models. Lecture 17 (Part l.) The Least Cost Starting Procedure. The Least Cost Starting Procedure. Starting with the least expensive Flow, we fill in as much flow for that Decision Variable, Xij, as possible.
E N D
Network Models Lecture 17 (Part l.) The Least Cost Starting Procedure FOMGT 353 Introduction to Management Science
The Least Cost Starting Procedure • Starting with the least expensive Flow, we fill in as much flow for that Decision Variable, Xij, as possible. • 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. • Move to the next least expensive Flow and fill in as much flow for that Decision Variable, Xij, as possible. • Goto 2. FOMGT 353 Introduction to Management Science
0 In x21, insert the min of S2 and D1 Subtract x21 from S2 and from D1. 15,000 Least Cost 1 FOMGT 353 Introduction to Management Science
10000 In x31, insert the min of S3 and D1 Subtract x31 from S3 and from D1. 0 Least Cost 2 FOMGT 353 Introduction to Management Science
In x11, insert the min of S1 and D1 Least Cost 3 FOMGT 353 Introduction to Management Science
0 In x32, insert the min of S3 and D2 Subtract x32 from S3 and from D2. 10000 Least Cost 4 FOMGT 353 Introduction to Management Science
In x22, insert the min of S2 and D2 Least Cost 5 FOMGT 353 Introduction to Management Science
0 In x12, insert the min of S1 and D2 Subtract x12 from S1 and from D2. 10000 Least Cost 6 FOMGT 353 Introduction to Management Science
Least Cost Initial Feasible Solution FOMGT 353 Introduction to Management Science