An introduction to integer and large-scale linear optimization

J. Cole Smith, Sibel B. Sonuc

Research output: Contribution to journalArticlepeer-review

3 Scopus citations


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 languageEnglish (US)
Pages (from-to)65-97
Number of pages33
JournalInternational Series in Operations Research and Management Science
StatePublished - 2011
Externally publishedYes

ASJC Scopus subject areas

  • Software
  • Computer Science Applications
  • Strategy and Management
  • Management Science and Operations Research
  • Applied Mathematics


Dive into the research topics of 'An introduction to integer and large-scale linear optimization'. Together they form a unique fingerprint.

Cite this