Review of Nonlinear Mixed-Integer and Disjunctive Programming Techniques

This paper has as a major objective to present a unified overview and derivation of mixed-integer nonlinear programming (MINLP) techniques, Branch and Bound, Outer-Approximation, Generalized Benders and Extended Cutting Plane methods, as applied to nonlinear discrete optimization problems that are e...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Optimization and engineering Ročník 3; číslo 3; s. 227 - 252
Hlavní autor: Grossmann, Ignacio E.
Médium: Journal Article
Jazyk:angličtina
Vydáno: Dordrecht Springer Nature B.V 01.09.2002
Témata:
Bending machines
Cutting
Derivation
Mathematical analysis
Mathematical models
Nonlinear programming
Nonlinearity
Optimization
Studies
ISSN:1389-4420, 1573-2924
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:This paper has as a major objective to present a unified overview and derivation of mixed-integer nonlinear programming (MINLP) techniques, Branch and Bound, Outer-Approximation, Generalized Benders and Extended Cutting Plane methods, as applied to nonlinear discrete optimization problems that are expressed in algebraic form. The solution of MINLP problems with convex functions is presented first, followed by a brief discussion on extensions for the nonconvex case. The solution of logic based representations, known as generalized disjunctive programs, is also described. Theoretical properties are presented, and numerical comparisons on a small process network problem.[PUBLICATION ABSTRACT]
Bibliografie:SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 14
ObjectType-Article-2
content type line 23
ISSN:1389-4420
1573-2924
DOI:10.1023/A:1021039126272