EMIS 8374 Arc-Path Formulation Updated 2 April 2008

Slides:



Advertisements
Similar presentations
Outline LP formulation of minimal cost flow problem
Advertisements

ECE Longest Path dual 1 ECE 665 Spring 2005 ECE 665 Spring 2005 Computer Algorithms with Applications to VLSI CAD Linear Programming Duality – Longest.
Network Flows. 2 Ardavan Asef-Vaziri June-2013Transportation Problem and Related Topics Table of Contents Chapter 6 (Network Optimization Problems) Minimum-Cost.
Management Science 461 Lecture 6 – Network Flow Problems October 21, 2008.
Lecture 10: Integer Programming & Branch-and-Bound
EMIS 8373: Integer Programming Valid Inequalities updated 4April 2011.
1 1 Slide © 2006 Thomson South-Western. All Rights Reserved. Slides prepared by JOHN LOUCKS St. Edward’s University.
ECE LP Duality 1 ECE 665 Spring 2005 ECE 665 Spring 2005 Computer Algorithms with Applications to VLSI CAD Linear Programming Duality.
1 Integrality constraints Integrality constraints are often crucial when modeling optimizayion problems as linear programs. We have seen that if our linear.
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.
1 Lecture 4 Maximal Flow Problems Set Covering Problems.
Lecture 4 – Network Flow Programming
Section 2.9 Maximum Flow Problems Minimum Cost Network Flows Shortest Path Problems.
Review for E&CE Find the minimal cost spanning tree for the graph below (where Values on edges represent the costs). 3 Ans. 18.
EMIS 8373: Integer Programming “Easy” Integer Programming Problems: Network Flow Problems updated 11 February 2007.
1 1 Slide © 2009 South-Western, a part of Cengage Learning Slides by John Loucks St. Edward’s University.
1 1 © 2003 Thomson  /South-Western Slide Slides Prepared by JOHN S. LOUCKS St. Edward’s University.
EMIS 8374 Network Flow Models updated 29 January 2008.
Lecture 5 – Integration of Network Flow Programming Models Topics Min-cost flow problem (general model) Mathematical formulation and problem characteristics.
& 6.855J & ESD.78J Algorithm Visualization The Ford-Fulkerson Augmenting Path Algorithm for the Maximum Flow Problem.
The Ford-Fulkerson Augmenting Path Algorithm for the Maximum Flow Problem Thanks to Jim Orlin & MIT OCW.
8/14/04J. Bard and J. W. Barnes Operations Research Models and Methods Copyright All rights reserved Lecture 5 – Integration of Network Flow Programming.
Integer Programming Key characteristic of an Integer Program (IP) or Mixed Integer Linear Program (MILP): One or more of the decision variable must be.
1 An Arc-Path Model for OSPF Weight Setting Problem Dr.Jeffery Kennington Anusha Madhavan.
EMIS 8373: Integer Programming Column Generation updated 12 April 2005.
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.
Review for E&CE Find the minimal cost spanning tree for the graph below (where Values on edges represent the costs). 3 Ans. 18.
EMIS 8374 Extra Credit Project: Graph Coloring Updated 22 April 2004.
Lecture 4 – Network Flow Programming Topics Terminology and Notation Network diagrams Generic problems (TP, AP, SPP, STP, MF) LP formulations Finding solutions.
Approximation Algorithms Duality My T. UF.
ENGM 631 Maximum Flow Solutions. Maximum Flow Models (Flow, Capacity) (0,3) (2,2) (5,7) (0,8) (3,6) (6,8) (3,3) (4,4) (4,10)
Tuesday, March 19 The Network Simplex Method for Solving the Minimum Cost Flow Problem Handouts: Lecture Notes Warning: there is a lot to the network.
St. Edward’s University
EMIS 8373: Integer Programming
Network Simplex Animations
Chapter 1. Introduction Mathematical Programming (Optimization) Problem: min/max
EMIS 8373: Integer Programming
Lecture 5 – Integration of Network Flow Programming Models
Multi-Commodity Flow Based Routing
Lecture 5 – Integration of Network Flow Programming Models
Maximum Flow Solutions
EMIS 8374 Node Splitting updated 27 January 2004
Solving maximum flows on distribution networks:
Transportation, Assignment and Network Models
Sensitivity Analysis and
Introduction Basic formulations Applications
1.206J/16.77J/ESD.215J Airline Schedule Planning
Vertex Covers, Matchings, and Independent Sets
Not Always Feasible 2 (3,5) 1 s (0,2) 3 (, u) t.
Network Models Robert Zimmer Room 6, 25 St James.
and 6.855J Flow Decomposition
Decision Making Process
Chapter 6 Network Flow Models.
Network Flow CSE 373 Data Structures.
A network problem is one that can be represented by...
Max Flow / Min Cut.
Advanced LP models column generation.
Minimum Cost Network Flow Problems
Advanced LP models column generation.
Reading before Lecture 13
EMIS 8374 Maximum Concurrent Flow Updated 3 April 2008
Not Always Feasible 2 (3,5) 1 s (0,2) 3 (, u) t.
A feasible solution for problem 2.
Network Flow Problems – Maximal Flow Problems
Maximum Flow Problems in 2005.
“Easy” Integer Programming Problems: Network Flow Problems
EMIS The Maximum Flow Problem: Flows and Cuts Updated 6 March 2008
The Residual Network Given a flow x, the residual capacity rij of arc (i, j) is the maximum additional flow that can be sent from i to j using arcs (i,
Lecture 12 Network Models.
Presentation transcript:

EMIS 8374 Arc-Path Formulation Updated 2 April 2008

Example Max Flow Problem (0,2) 2 4 (0,5) (0,4) 1 (0,4) 6 t s (0,6) (0,7) (0,5) 3 5

Node-Arc Formulation

Arc-Path Formulation: Notation P denotes the set of paths from s to t Ap denotes the set of arcs in path p Uij denotes the set of paths that use arc (i, j) uij denotes the capacity of arc (i, j) Decision variables fp denotes the amount of flow on path p v denotes the amount of flow sent from s to t

Arc-Path Formulation: LP

Arc-Path Formulation for Example Problem Pst = {1, 2, 3} where A1={(1, 2), (2, 4), (4, 6)} A2={(1, 2), (2, 5), (5, 6)} A3= {(1, 3), (3, 5), (5, 6)} U1,2 = {1, 2}, U1,3 = {3} U2,4 = {1}, U2,5 = {2} U3,5 = {3}, U4,6 = {1}, U5,6 = {2, 3}

Arc-Path Formulation: LP

Example Max Flow Solution (2,2) 2 4 (4,5) (2,4) 1 (2,4) 6 t s (5,6) (7,7) (5,5) 3 5 f1 = 2

Example Max Flow Solution (2,2) 2 4 (4,5) (2,4) 1 (2,4) 6 t s (5,6) (7,7) (5,5) 3 5 f1 = 2 f2 = 2

Example Max Flow Solution (2,2) 2 4 (4,5) (2,4) 1 (2,4) 6 t s (5,6) (7,7) (5,5) 3 5 f1 = 2 f2 = 2 f3 = 5

Arc-Path Model: Pros and Cons Facilitates modeling side constraints on paths (e.g., hop-count limits) Explicitly maps flows to paths Cons Doesn’t guarantee integer solutions Requires explicitly listing paths in P