Relaxation and Decomposition

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 1 in Optimization via Relaxation and Decomposition, 2025, pp 1-10 from Springer

Abstract: Abstract More often than not, engineering optimization problems are nonlinear and nonconvex and large in terms of the number of variables and constraints. These two characteristics render off-the-shelf solution techniques (and the solvers that implement them) generally useless. On one hand, relaxation techniques in optimization seek to reduce the complexity resulting from nonconvex nonlinearities by convexifying, linearizing, or simply ignoring certain not-that-relevant constraints. On the other hand, decomposition procedures seek to solve a large optimization problem by breaking it into small subproblems within an iterative process. The combination of relaxation and decomposition often allows solving large-scale nonlinear and nonconvex engineering optimization problems effectively and accurately, and this is the focus of this monograph.

Keywords: Relaxation; Decomposition (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_1

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

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

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