Relaxation

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

Chapter Chapter 7 in Integrated Methods for Optimization, 2012, pp 371-534 from Springer

Abstract: Abstract The ideal problem relaxation is both easy to solve and in some sense tight, meaning that it closely resembles the original problem. The solution of a tight relaxation is more likely to be feasible in the original problem, or if not, to provide a good bound on the optimal value of the original problem.

Keywords: Convex Hull; Mixed Integer Linear Programming; Master Problem; Valid Inequality; Continuous 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_7

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

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

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