Global optimization of nonlinear generalized disjunctive programming with bilinear equality constraints: applications to process networks

@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}
}
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
BETA

Citations

Publications citing this paper.
SHOWING 1-10 OF 44 CITATIONS

References

Publications referenced by this paper.

Similar Papers

Loading similar papers…