Journal
COMPUTERS & CHEMICAL ENGINEERING
Volume 28, Issue 10, Pages 1951-1966Publisher
PERGAMON-ELSEVIER SCIENCE LTD
DOI: 10.1016/j.compchemeng.2004.03.011
Keywords
discrete-continuous nonlinear optimization; disjunctive programming; complementarity; process engineering; mixed-integer dynamic optimization
Ask authors/readers for more resources
This paper treats the solution of nonlinear optimization problems involving discrete decision variables, also known as generalized disjunctive programming (GDP) or mixed-integer nonlinear programming (MINLP) problems, that arise in process engineering. The key idea is to eliminate the discrete decision variables by adding a set of continuous variables and constraints that represent the discrete decision space of the optimization problem. With such a reformulation, we are able to apply solution algorithms for purely continuous nonlinear optimization problems to efficiently calculate local minima of GDP or MINLP problems. In this contribution, we propose different alternatives to reformulate GDP/MINLP problems as continuous optimization problems. We furthermore investigate theoretical properties of the different reformulations with regard to their numerical solution. The proposed formulations are illustrated and analyzed on the basis of optimization problems dealing with process engineering applications involving stationary as well as dynamic process models. (C) 2004 Elsevier Ltd. All rights reserved.
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