2008
DOI: 10.1016/j.apnum.2007.01.023
|View full text |Cite
|
Sign up to set email alerts
|

Solving a dynamic separation problem using MINLP techniques

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2020
2020
2021
2021

Publication Types

Select...
1
1

Relationship

0
2

Authors

Journals

citations
Cited by 2 publications
(1 citation statement)
references
References 13 publications
0
1
0
Order By: Relevance
“…Both gradient-based non-linear programming (NLP) solvers (e.g., interior-point algorithms [30], sequential programming [29], or simplex [11]) and derivative-free approaches (e.g., genetic algorithm [31] and Gaussian process regression [32]) were used successfully for optimal process design. Moreover, mixed-integer non-linear programming (MINLP) was applied to general process optimization using extended cutting plane algorithms [33], as well as for structural decision variables using outer approximation [34], and evolutionary algorithms [35]. The examples show that many different approaches exist for optimizing chromatographic processes.…”
Section: Process Optimizationmentioning
confidence: 99%
“…Both gradient-based non-linear programming (NLP) solvers (e.g., interior-point algorithms [30], sequential programming [29], or simplex [11]) and derivative-free approaches (e.g., genetic algorithm [31] and Gaussian process regression [32]) were used successfully for optimal process design. Moreover, mixed-integer non-linear programming (MINLP) was applied to general process optimization using extended cutting plane algorithms [33], as well as for structural decision variables using outer approximation [34], and evolutionary algorithms [35]. The examples show that many different approaches exist for optimizing chromatographic processes.…”
Section: Process Optimizationmentioning
confidence: 99%