Journal
JOURNAL OF GLOBAL OPTIMIZATION
Volume 43, Issue 2-3, Pages 277-297Publisher
SPRINGER
DOI: 10.1007/s10898-007-9271-9
Keywords
MINLP; Column enumeration; Decomposition; Packing
Ask authors/readers for more resources
We propose a decomposition algorithm for a special class of nonconvex mixed integer nonlinear programming problems which have an assignment constraint. If the assignment decisions are decoupled from the remaining constraints of the optimization problem, we propose to use a column enumeration approach. The master problem is a partitioning problem whose objective function coefficients are computed via subproblems. These problems can be linear, mixed integer linear, (non-)convex nonlinear, or mixed integer nonlinear. However, the important property of the subproblems is that we can compute their exact global optimum quickly. The proposed technique will be illustrated solving a cutting problem with optimum nonlinear programming subproblems.
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