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...
Gespeichert in:
| Veröffentlicht in: | Optimization and engineering Jg. 3; H. 3; S. 227 - 252 |
|---|---|
| 1. Verfasser: | |
| Format: | Journal Article |
| Sprache: | Englisch |
| Veröffentlicht: |
Dordrecht
Springer Nature B.V
01.09.2002
|
| Schlagworte: | |
| ISSN: | 1389-4420, 1573-2924 |
| Online-Zugang: | Volltext |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| Zusammenfassung: | 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] |
|---|---|
| Bibliographie: | 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 |