Journal
OPTIMIZATION AND ENGINEERING
Volume 3, Issue 3, Pages 227-252Publisher
SPRINGER
DOI: 10.1023/A:1021039126272
Keywords
mixed-integer programming; disjunctive programming; nonlinear programming
Categories
Funding
- National Science Foundation [ACI-0121497]
Ask authors/readers for more resources
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.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available