Duality

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

Chapter Chapter 4 in Integrated Methods for Optimization, 2012, pp 109-159 from Springer

Abstract: Abstract Duality provides a key to unifying optimization methods, because it connects search with the two primary mechanisms for exploiting problem structure: inference and relaxation. One can solve an optimization problem by searching for the best solution, but one can simultaneously search for a solution of the inference dual and/or the relaxation dual. The inference dual seeks to prove optimality by deducing from the constraints the tightest possible bound on the optimal value. The relaxation dual seeks the tightest bound that can be obtained by solving a relaxation of the problem.

Keywords: Leaf Node; Search Tree; Linear Programming Problem; Lagrangean Relaxation; Linear Programming Relaxation (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_4

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

DOI: 10.1007/978-1-4614-1900-6_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 ().