Journal
JOURNAL OF GLOBAL OPTIMIZATION
Volume 32, Issue 3, Pages 417-431Publisher
SPRINGER
DOI: 10.1007/s10898-004-5903-5
Keywords
branch and bound; concave objective function; global optimization; mixed-integer nonlinear programming (MINLP); piece-wise linear underestimator; portfolio optimization
Ask authors/readers for more resources
The rigorous and efficient determination of the global solution of a nonconvex MINLP problem arising from product portfolio optimization introduced by Kallrath (2003) is addressed. The objective of the optimization problem is to determine the optimal number and capacity of reactors satisfying the demand and leading to a minimal total cost. Based on the model developed by Kallrath (2003), an improved formulation is proposed, which consists of a concave objective function and linear constraints with binary and continuous variables. A variety of techniques are developed to tighten the model and accelerate the convergence to the optimal solution. A customized branch and bound approach that exploits the special mathematical structure is proposed to solve the model to global optimality. Computational results for two case studies are presented. In both case studies, the global solutions are obtained and proved optimal very efficiently in contrast to available commercial MINLP solvers.
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