An Introduction to Integer and Large-Scale Linear Optimization

J. Cole Smith () and Sibel B. Sonuc ()
Additional contact information
J. Cole Smith: University of Florida
Sibel B. Sonuc: University of Florida

Chapter Chapter 4 in Wireless Network Design, 2011, pp 65-97 from Springer

Abstract: 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.

Keywords: Extreme Point; Feasible Region; Master Problem; Valid Inequality; Linear Program Relaxation (search for similar items in EconPapers)
Date: 2011
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:isochp:978-1-4419-6111-2_4

Ordering information: This item can be ordered from
http://www.springer.com/9781441961112

DOI: 10.1007/978-1-4419-6111-2_4

Access Statistics for this chapter

More chapters in International Series in Operations Research & Management Science from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().