A joint decomposition method for global optimization of multiscenario nonconvex mixed-integer nonlinear programs
Loading...
Authors
Ogbe, Emmanuel
Li, Xiang
Date
2019-11-01
Type
journal article
Language
Keyword
Alternative Title
Abstract
This paper proposes a joint decomposition method that combines Lagrangian decomposition and generalized Benders decomposition, to efficiently solve multiscenario nonconvex mixed-integer nonlinear programming (MINLP) problems to global optimality, without the need for explicit branch and bound search. In this approach, we view the variables coupling the scenario dependent variables and those causing nonconvexity as complicating variables. We systematically solve the Lagrangian decomposition subproblems and the generalized Benders decomposition subproblems in a unified framework. The method requires the solution of a difficult relaxed master problem, but the problem is only solved when necessary. Enhancements to the method are made to reduce the number of the relaxed master problems to be solved and ease the solution of each relaxed master problem. We consider two scenario-based, two-stage stochastic nonconvex MINLP problems that arise from integrated design and operation of process networks in the case study, and we show that the proposed method can solve the two problems significantly faster than state-of-the-art global optimization solvers.
Description
Citation
Ogbe, E., & Li, X. (2019). A joint decomposition method for global optimization of multiscenario nonconvex mixed-integer nonlinear programs. Journal of Global Optimization, 75(3), 595–629. doi:10.1007/s10898-019-00786-x
Publisher
Springer Science and Business Media LLC
License
Final publication available at: http://dx.doi.org/10.1007/s10898-019-00786-x