Optimization Basics

John N. Hooker ()
Additional contact information
John N. Hooker: Carnegie Mellon University

Chapter Chapter 3 in Integrated Methods for Optimization, 2012, pp 65-108 from Springer

Abstract: Abstract Much of the material in this book presupposes a basic understanding of classical optimization methods, particularly linear programming, network flows, convex nonlinear programming, and dynamic programming. Linear programming is a ubiquitous relaxation tool and finds application in domain reduction, branch-and-price methods, and other techniques. Network flows play a central role in filtering methods for several global constraints. Nonlinear programming is used to solve convex relaxations and reduce variable domains in global optimization problems. Dynamic programming can be useful for domain reduction in sequencing problems and elsewhere.

Keywords: Span Tree; Basic Solution; Knapsack Problem; Simplex Method; Basic Feasible Solution (search for similar items in EconPapers)
Date: 2012
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-4614-1900-6_3

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

DOI: 10.1007/978-1-4614-1900-6_3

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 ().