This preview shows pages 1–2. Sign up to view the full content.
This preview has intentionally blurred sections. Sign up to view the full version.View Full Document
Unformatted text preview: ISE 536Fall03: Linear Programming and Extensions December 3, 2003 Lecture 25: LP in Research Lecturer: Fernando Ord onez Robust Capacity Expansion of Transit Networks 1 Capacity expansion problem We consider the problem of deciding investment decisions on a given transit network. A standard solution approach for this problem is to formulate this as a network flow prob- lem with decision variables for possible capacity expansions. This leads to the following formulation: min x,y c t x s . t . Nx = b x u + y d t y I x , y , (1) where y are investment decisions, d t y is the total investment cost (bounded by a budget I ). Nx = b are the conservation of flow equations. c t x is the total (average) travel time. This is a classic network flow formulation for the network design problem. Some simple and extensions to this model:- Consider integer investment decision variables....
View Full Document
This note was uploaded on 02/13/2012 for the course ISE 536 taught by Professor Yy during the Spring '05 term at South Carolina.
- Spring '05