Simplifying via Reformulation, Approximation, and Relaxation

Gonzalo E. Constante-Flores and Antonio J. Conejo
Additional contact information
Gonzalo E. Constante-Flores: Purdue University
Antonio J. Conejo: The Ohio State University

Chapter Chapter 2 in Optimization via Relaxation and Decomposition, 2025, pp 11-44 from Springer

Abstract: Abstract As a means of achieving tractability or reducing the computational burden of an optimization problem, this chapter considers reformulations, approximations, and relaxations. We first consider reformulation procedures and then discuss approximation and relaxation techniques. Regarding approximations and relaxations, we discuss linearization procedures and convexification techniques. We note that the latter are more limited in scope than the former. We note as well that most approximation/relaxation techniques can be improved iteratively. We conclude with some remarks of practical significance.

Keywords: Reformulation; Approximation; Relaxation (search for similar items in EconPapers)
Date: 2025
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-3-031-87405-5_2

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

DOI: 10.1007/978-3-031-87405-5_2

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