Highly Influenced

8 Excerpts

@article{Lee2003GlobalOO, title={Global optimization of nonlinear generalized disjunctive programming with bilinear equality constraints: applications to process networks}, author={Sangbum Lee and Ignacio E. Grossmann}, journal={Computers & Chemical Engineering}, year={2003}, volume={27}, pages={1557-1575} }

- Published in Computers & Chemical Engineering 2003
DOI:10.1016/S0098-1354(03)00098-X

A global optimization method is proposed for the solution of nonconvex generalized disjunctive programming problems that have bilinear equality constraints in terms of flows, compositions and split fractions. Tight convex under/over estimators are introduced for the relaxation of nonconvex constraints to construct the lower bound problem. Discrete choices for process networks are expressed as disjunctions, which are relaxed by a convex hull formulation. The relaxed convex NLP problem is solved… CONTINUE READING