2020
DOI: 10.1016/j.compchemeng.2019.106657
|View full text |Cite
|
Sign up to set email alerts
|

Adjoint optimization for the general rate model of liquid chromatography

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2020
2020
2024
2024

Publication Types

Select...
5

Relationship

0
5

Authors

Journals

citations
Cited by 6 publications
(1 citation statement)
references
References 45 publications
0
1
0
Order By: Relevance
“…Optimization problems can be solved in many ways (e.g., genetic algorithm) 4,32,33 . However, they can be classified into two main categories, derivative‐free and derivative‐based optimization 34,35 . The solver choice is based on the structure and complexity of the problem, such as linearity or non‐linearity of the cost function and constraints.…”
Section: Model Predictive Controlmentioning
confidence: 99%
“…Optimization problems can be solved in many ways (e.g., genetic algorithm) 4,32,33 . However, they can be classified into two main categories, derivative‐free and derivative‐based optimization 34,35 . The solver choice is based on the structure and complexity of the problem, such as linearity or non‐linearity of the cost function and constraints.…”
Section: Model Predictive Controlmentioning
confidence: 99%