Abstract
This chapter provides an introductory analysis of linear programming foundations and large-scale methods. The chapter begins by discussing the basics of linear programming modeling and solution properties, duality principles for linear programming problems, and extensions to integer programming methods. We then develop Benders decomposition, Dantzig-Wolfe decomposition, and Lagrangian optimization procedures in the context of network design and routing problems that arise in telecommunications operations research studies. The chapter closes with a brief discussion and list of basic references for other large-scale optimization algorithms that are commonly used to optimize telecommunications systems, including basis partitioning, interior point, and heuristic methods.
Original language | English (US) |
---|---|
Pages (from-to) | 65-97 |
Number of pages | 33 |
Journal | International Series in Operations Research and Management Science |
Volume | 158 |
DOIs | |
State | Published - 2011 |
Externally published | Yes |
ASJC Scopus subject areas
- Software
- Computer Science Applications
- Strategy and Management
- Management Science and Operations Research
- Applied Mathematics