Abstract
IN THIS CHAPTER WE are interested in studying two types of mathematical programs. The first type consists of programs that have so-called near-network structure. The second type consists of large-scale mathematical programs that may be derived from network considerations, but whose constraints may not be characterized as nearly totally modular. This chapter is organized as follows.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsNotes
- 1.
We will use the notation w j for extreme points rather than v j since the extreme pints of interest in Benders method are those of the cone K(c), not those of the primal formulation (5.118).
- 2.
5.10 References and Additional Reading
Bazaraa, M. S., Jarvis, J. J., & Sherali, H. D. (2011). Linear programming and network flows. John Wiley & Sons
Bertsekas, D. B. (1998). Network optimization: Continuous and discrete models. Cambridge, MA: Athena Publishing.
Bradley, S. P., Hax, A. C., & Magnanti, T. L. (1977). Applied mathematical programming. Reading, MA: Addison-Wesley.
Gabriel, S. A., & Bernstein, D. (2000). Nonadditive shortest paths: Subproblems in multi-agent competitive network models. Computational and Mathematical Organization Theory, 6, 29–45.
Guignard, M., & Kim, S. (1987). Lagrangean decomposition: A model yielding stronger lagrangean bounds. Mathematical Programming, 39(2), 215–230.
Lasdon, L. (1970). Optimization theory for large systems. New York: Macmillan.
Lawphongpanich, S., & Hearn, D. W. (1984). Simplicial decomposition of the assymmetric traffic assignment problem. Transportation Research, 18B, 123–133.
Mangasarian, O. L. (1993). Nonlinear programming, Philadelphia: SIAM
Rockafeller, R. T. (1970). Convex analysis. Princeton, NJ: Princeton University Press.
Scott, K., Pabon-Jimenez, G., & Bernstein, D. (1997). Finding alternatives to the best path. In Presented at the 76th transportation research board annual meeting, Washington, DC.
Shapiro, J. (1979). Mathematical programming: Structure and algorithms. New York: Wiley.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2016 Springer Science+Business Media New York
About this chapter
Cite this chapter
Friesz, T.L., Bernstein, D. (2016). Near-Network and Large-Scale Programs. In: Foundations of Network Optimization and Games. Complex Networks and Dynamic Systems, vol 3. Springer, Boston, MA. https://doi.org/10.1007/978-1-4899-7594-2_5
Download citation
DOI: https://doi.org/10.1007/978-1-4899-7594-2_5
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4899-7593-5
Online ISBN: 978-1-4899-7594-2
eBook Packages: Business and ManagementBusiness and Management (R0)