Stevenson and Ozgur First Edition Introduction to Management Science with Spreadsheets McGraw-Hill/Irwin Copyright © 2007 by The McGraw-Hill Companies,

Slides:

Advertisements

Similar presentations

Outline LP formulation of minimal cost flow problem

Advertisements

Chapter 11 To accompany Quantitative Analysis for Management, Eleventh Edition, Global Edition by Render, Stair, and Hanna Power Point slides created by.

Transportation, Transshipment, and Assignment Problems

Operations Management

Part 3 Probabilistic Decision Models

Transportation and Assignment Solution Procedures

Stevenson and Ozgur First Edition Introduction to Management Science with Spreadsheets McGraw-Hill/Irwin Copyright © 2007 by The McGraw-Hill Companies,

© 2003 The McGraw-Hill Companies, Inc. All rights reserved. Project Analysis and Evaluation Chapter Eleven.

© 2003 The McGraw-Hill Companies, Inc. All rights reserved. Credit and Inventory Management Chapter Twenty-One.

© 2003 The McGraw-Hill Companies, Inc. All rights reserved. Working with Financial Statements Chapter Three.

© 2003 The McGraw-Hill Companies, Inc. All rights reserved. Raising Capital Chapter Sixteen.

© 2003 The McGraw-Hill Companies, Inc. All rights reserved. Options and Corporate Finance Chapter Fourteen.

© 2003 The McGraw-Hill Companies, Inc. All rights reserved. Introduction to Valuation: The Time Value of Money Chapter Five.

Chapter 7 Network Flow Models.

© 2003 The McGraw-Hill Companies, Inc. All rights reserved. Net Present Value and Other Investment Criteria Chapter Nine.

© 2003 The McGraw-Hill Companies, Inc. All rights reserved. Short-Term Finance and Planning Chapter Nineteen.

© 2003 The McGraw-Hill Companies, Inc. All rights reserved. Discounted Cash Flow Valuation Chapter Six.

© 2003 The McGraw-Hill Companies, Inc. All rights reserved. Determining the Target Cash Balance Chapter Twenty A.

© 2003 The McGraw-Hill Companies, Inc. All rights reserved. Long-Term Financial Planning and Growth Chapter Four.

© 2003 The McGraw-Hill Companies, Inc. All rights reserved. Interest Rates and Bond Valuation Chapter Seven.

© 2003 The McGraw-Hill Companies, Inc. All rights reserved. Risk Management: An Introduction to Financial Engineering Chapter Twenty- Three.

Chapter 11 Network Models. What You Need to Know For each of the three models: –What is the model? (what are given and what is to calculate) –What is.

© 2008 Prentice-Hall, Inc. Chapter 12 To accompany Quantitative Analysis for Management, Tenth Edition, by Render, Stair, and Hanna Power Point slides.

Network Flow Models Chapter 7.

© 2003 The McGraw-Hill Companies, Inc. All rights reserved. Option Valuation Chapter Twenty- Four.

© 2003 The McGraw-Hill Companies, Inc. All rights reserved. Return, Risk, and the Security Market Line Chapter Thirteen.

MNG221 - Management Science

Stevenson and Ozgur First Edition Introduction to Management Science with Spreadsheets McGraw-Hill/Irwin Copyright © 2007 by The McGraw-Hill Companies,

To accompany Quantitative Analysis for Management, 9e by Render/Stair/Hanna 12-1 © 2006 by Prentice Hall, Inc. Upper Saddle River, NJ Chapter 12.

1 1 Slide © 2000 South-Western College Publishing/ITP Slides Prepared by JOHN LOUCKS.

Introduction to Management Science

NetworkModel-1 Network Optimization Models. NetworkModel-2 Network Terminology A network consists of a set of nodes and arcs. The arcs may have some flow.

Stevenson and Ozgur First Edition Introduction to Management Science with Spreadsheets McGraw-Hill/Irwin Copyright © 2007 by The McGraw-Hill Companies,

Max-flow/min-cut theorem Theorem: For each network with one source and one sink, the maximum flow from the source to the destination is equal to the minimal.

Computational Methods for Management and Economics Carla Gomes Module 9d Network Models Maximum Flow Problem (Slides adapted from J.Orlin’s and Hillier’s)

Stevenson and Ozgur First Edition Introduction to Management Science with Spreadsheets McGraw-Hill/Irwin Copyright © 2007 by The McGraw-Hill Companies,

Stevenson and Ozgur First Edition Introduction to Management Science with Spreadsheets McGraw-Hill/Irwin Copyright © 2007 by The McGraw-Hill Companies,

7-1 Copyright © 2010 Pearson Education, Inc. Publishing as Prentice Hall Network Flow Models Chapter 7.

7-1 Copyright © 2013 Pearson Education, Inc. Publishing as Prentice Hall Network Flow Models Chapter 7.

Shortest Route, Minimal Spanning Tree and Maximal Flow Models

and 6.855J The Capacity Scaling Algorithm.

Network Optimization Models

Stevenson and Ozgur First Edition Introduction to Management Science with Spreadsheets McGraw-Hill/Irwin Copyright © 2007 by The McGraw-Hill Companies,

Stevenson and Ozgur First Edition Introduction to Management Science with Spreadsheets McGraw-Hill/Irwin Copyright © 2007 by The McGraw-Hill Companies,

1 1 Slide © 2008 Thomson South-Western. All Rights Reserved Slides by JOHN LOUCKS St. Edward’s University.

Minimum Spanning Trees: Chapter 6s The Modern Corp. Problem Modern Corporation has decided to have a state-of-the-art fiber-optic network installed to.

Welcome to MM305 Unit 6 Seminar Larry Musolino

1 1 © 2003 Thomson  /South-Western Slide Slides Prepared by JOHN S. LOUCKS St. Edward’s University.

Stevenson and Ozgur First Edition Introduction to Management Science with Spreadsheets McGraw-Hill/Irwin Copyright © 2007 by The McGraw-Hill Companies,

Welcome Unit 6 Seminar MM305 Wednesday 8:00 PM ET Quantitative Analysis for Management Delfina Isaac.

Stevenson and Ozgur First Edition Introduction to Management Science with Spreadsheets McGraw-Hill/Irwin Copyright © 2007 by The McGraw-Hill Companies,

Welcome to MM305 Unit 6 Seminar Dr. Bob Network Models.

Chapter 5: Transportation, Assignment and Network Models © 2007 Pearson Education.

1 1 Slide © 2008 Thomson South-Western. All Rights Reserved © 2011 Cengage Learning. All Rights Reserved. May not be scanned, copied or duplicated, or.

8s-1 McGraw-Hill Ryerson Operations Management, 2 nd Canadian Edition, by Stevenson & Hojati Copyright © 2004 by The McGraw-Hill Companies, Inc. All rights.

7-1 Copyright © 2010 Pearson Education, Inc. Publishing as Prentice Hall Network Flow Models Chapter 7.

McGraw-Hill/Irwin © 2003 The McGraw-Hill Companies, Inc., All Rights Reserved. Example 1-Ad A.

Mjdah Al Shehri Hamdy A. Taha, Operations Research: An introduction, 8 th Edition Chapter 6: Network Models.

Transportation, Assignment, and Network Models 9 To accompany Quantitative Analysis for Management, Twelfth Edition, by Render, Stair, Hanna and Hale Power.

1 1 Slide © 2005 Thomson/South-Western Chapter 9 Network Models n Shortest-Route Problem n Minimal Spanning Tree Problem n Maximal Flow Problem.

Operations Research II Course,, September Part 2: Network Flow Operations Research II Dr. Aref Rashad.

Network Models Chapter 12

Network Models Chapter 12

Chapter 12 Network Models 12-1

Transportation, Assignment and Network Models

MATS Quantitative Methods Dr Huw Owens

Introduction Basic formulations Applications

Network Models 7-1.

Network Models Chapter 12

Chapter 6 Network Flow Models.

Presentation transcript:

Stevenson and Ozgur First Edition Introduction to Management Science with Spreadsheets McGraw-Hill/Irwin Copyright © 2007 by The McGraw-Hill Companies, Inc. All rights reserved. Chapter 8 Network Optimization Models Part 2 Deterministic Decision Models

Copyright © 2007 The McGraw-Hill Companies. All rights reserved. McGraw-Hill/Irwin 8–2 NetworksNetworks Network –A set of nodes and connecting arcs or branches. Can be useful in representing various systems, such as distribution systems, production systems, and transportation systems. Network models are an important approach for problem solving because: –They can be used to model a wide range of problems. –They are relatively simple to work with –They provide a visual portrayal of a problem.

Copyright © 2007 The McGraw-Hill Companies. All rights reserved. McGraw-Hill/Irwin 8–3 Frequently Used Algorithms Shortest-Route Algorithm –Used for determining the shortest time, distance, or cost from an origin to a destination through a network. Minimum Spanning Tree Algorithm –Used in determining the minimum distance (cost, time) needed to connect a set of locations into a single system. Maximal Flow Algorithm –Used for determining the greatest amount of flow that can be transmitted through a system in which various branches, or connections, have specified flow capacity limitations.

Copyright © 2007 The McGraw-Hill Companies. All rights reserved. McGraw-Hill/Irwin 8–4 Figure 8–1A Simple Network Diagram

Copyright © 2007 The McGraw-Hill Companies. All rights reserved. McGraw-Hill/Irwin 8–5 Example 8-1 Labeling Procedure A label is developed for each node. The labels consist of two numbers separated by a comma: The first number refers to the distance from Node 1 to the labeled node along a certain path, while the second number refers to the node that immediately precedes this node along that path.

Copyright © 2007 The McGraw-Hill Companies. All rights reserved. McGraw-Hill/Irwin 8–6 Example 8-1 (cont’d)

Copyright © 2007 The McGraw-Hill Companies. All rights reserved. McGraw-Hill/Irwin 8–7 Example 8-1 (cont’d)

Copyright © 2007 The McGraw-Hill Companies. All rights reserved. McGraw-Hill/Irwin 8–8 Figure 8–2Network for Tri-State Shipping Company Shortest-Route Problem

Copyright © 2007 The McGraw-Hill Companies. All rights reserved. McGraw-Hill/Irwin 8–9 Figure 8–3Network for Oil Pipeline Problem Note: Arc lengths are not precisely proportional to the distances shown on the arcs.

Copyright © 2007 The McGraw-Hill Companies. All rights reserved. McGraw-Hill/Irwin 8–10 Example 8-3

Copyright © 2007 The McGraw-Hill Companies. All rights reserved. McGraw-Hill/Irwin 8–11 Example 8-3 (cont’d)

Copyright © 2007 The McGraw-Hill Companies. All rights reserved. McGraw-Hill/Irwin 8–12 Example 8-3 (cont’d)

Copyright © 2007 The McGraw-Hill Companies. All rights reserved. McGraw-Hill/Irwin 8–13 Figure 8–4A Flow Network

Copyright © 2007 The McGraw-Hill Companies. All rights reserved. McGraw-Hill/Irwin 8–14 Figure 8–5Updated Flow Network

Copyright © 2007 The McGraw-Hill Companies. All rights reserved. McGraw-Hill/Irwin 8–15 Figure 8–6Second Revision of the Network

Copyright © 2007 The McGraw-Hill Companies. All rights reserved. McGraw-Hill/Irwin 8–16 Figure 8–7Third Revision of Flow Network

Copyright © 2007 The McGraw-Hill Companies. All rights reserved. McGraw-Hill/Irwin 8–17 Figure 8–8Final Solution for Flow Network Example

Copyright © 2007 The McGraw-Hill Companies. All rights reserved. McGraw-Hill/Irwin 8–18 Figure 8–9Flow Network for Demonstration of Reverse Flow

Copyright © 2007 The McGraw-Hill Companies. All rights reserved. McGraw-Hill/Irwin 8–19 Figure 8–10Flow Network for Demonstration of Reverse Flow

Copyright © 2007 The McGraw-Hill Companies. All rights reserved. McGraw-Hill/Irwin 8–20 Figure 8–11Revised Flow Network

Copyright © 2007 The McGraw-Hill Companies. All rights reserved. McGraw-Hill/Irwin 8–21 Table 8–1Branches of the Network and Flow Capacities of the Branches for the Turkmen Oil Ltd. Maximal Flow Problem

Copyright © 2007 The McGraw-Hill Companies. All rights reserved. McGraw-Hill/Irwin 8–22 Figure 8–12Network Diagram for the Maximal Flow Problem for Turkmen Oil Ltd.