.png){kind=icon}
Return
New algorithms for nonlinear generalized disjunctive programming
.png){kind=icon}
PRE
AI
DOI：10.1016/S0098-1354(00)00581-0.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Generalized disjunctive programming (GDP) has been introduced recently as an alternative model to MINLP for representing discrete/continuous optimization problems. The basic idea of GDP consists of representing discrete decisions in the continuous space with disjunctions, and constraints in the discrete space with logic propositions. In this paper, we describe a new convex nonlinear relaxation of the nonlinear GDP problem that relies on the use of the convex hull of each of the disjunctions involving nonlinear inequalities. The proposed nonlinear relaxation is used to reformulate the GDP problem as a tight MINLP problem, and for deriving a branch and bound method. Properties of these methods are given, and the relation of this method with the logic based outer-approximation method is established. Numerical results are presented for problems in jobshop scheduling synthesis of process networks, optimal positioning of new products and batch process design. (C) 2000 Elsevier Science Ltd. All rights reserved.
Keywords:
generalized disjunctive programming
branch and bound
mixed-integer nonlinear programming
nonlinear convex hull
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
C
IF:
3.9
Papers:
8.1K
Citations:
1.7W
Organization
No organization information available
Cited Papers
.png){kind=icon}
ShareSaveShareSaveShareSave
View more