Mixed-integer dynamic optimization

Autor:	Paul I. Barton, Russell Allgor
Rok vydání:	1997
Předmět:	Continuous optimization Mathematical optimization Optimization problem General Chemical Engineering Discrete space Enumeration Finite set Global optimization Upper and lower bounds Computer Science Applications Integer (computer science) Mathematics
Zdroj:	Computers & Chemical Engineering. 21:S451-S456
ISSN:	0098-1354
DOI:	10.1016/s0098-1354(97)87543-6
Popis:	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.
Databáze:	OpenAIRE
Externí odkaz:	https://explore.openaire.eu/search/publication?articleId=doi_________::98aa7480c3edb0c2cb62dc6890d5b755 https://doi.org/10.1016/s0098-1354(97)87543-6 Zobrazit plný text záznamu Full Text from ScienceDirect