.png){kind=icon}
Return
Mixed-integer dynamic optimization I: problem formulation
.png){kind=icon}
PRE
AI
DOI：10.1016/S0098-1354(98)00294-4.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
A rigorous decomposition approach is presented for mixed-integer dynamic optimization problems. The approach combines dynamic optimization with insight based targeting techniques to decompose the optimization into subproblems providing rigorous upper and lower bounds on the objective. This approach has the potential to eliminate total enumeration of the discrete space, assures termination in a finite number of iterations and yields a rigorous bound on the distance between the solution found and the global solution. (C) 1999 Elsevier Science Ltd. All rights reserved.
Keywords:
GENERALIZED BENDERS DECOMPOSITION
GLOBAL OPTIMIZATION
BATCH DISTILLATION
PATH CONSTRAINTS
SYSTEMS
DESIGN
UNCERTAINTY
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}
ShareSaveShareSave
ShareSaveShareSave
View more