4.6 Article

Simultaneous design and NMPC control under uncertainty and structural decisions: A discrete-steepest descent algorithm

Journal

AICHE JOURNAL
Volume -, Issue -, Pages -

Publisher

WILEY
DOI: 10.1002/aic.18188

Keywords

discrete-steepest descent algorithm; integration of design and control; mathematical programs with complementarity constraints; mixed-integer bilevel problem; nonlinear model predictive control

Ask authors/readers for more resources

In this article, the integration problem of design and nonlinear model-based control under uncertainty and structural decisions is addressed. An algorithmic framework is proposed to determine the optimal location of process units or streams in closed-loop with a model-based controller. The problem is formulated as a mixed-integer bilevel problem (MIBLP) and transformed into a single-level mixed-integer nonlinear problem (MINLP) using a KKT transformation strategy. The methodology decomposes the MINLP into an integer-based master problem and primal subproblems, which are solved using a Discrete-Steepest Descent Algorithm (D-SDA). The discrete-based methodology is illustrated in a case study for a binary distillation column, where D-SDA outperforms the benchmark continuous-based formulation using differentiable distribution functions (DDFs).
In this article, we address the integration of design and nonlinear model-based control under uncertainty and structural decisions for naturally ordered structures. We propose an algorithmic framework to determine the optimal location of process units or streams over an ordered discrete set that operates in closed-loop with a model-based controller. The formulation corresponds to a mixed-integer bilevel problem (MIBLP) that is transformed into a single-level mixed-integer nonlinear problem (MINLP) using a KKT transformation strategy. In our methodology, the integer decisions are partitioned into subsets called external variables, such that the MINLP is decomposed into an integer-based master problem and primal subproblems with fixed discrete variables. The master and primal problems are solved using a Discrete-Steepest Descent Algorithm (D-SDA). We illustrate the discrete-based methodology in a case study for a binary distillation column. The D-SDA showed an improved performance compared to a benchmark continuous-based formulation using differentiable distribution functions (DDFs).

Authors

I am an author on this paper
Click your name to claim this paper and add it to your profile.

Reviews

Primary Rating

4.6
Not enough ratings

Secondary Ratings

Novelty
-
Significance
-
Scientific rigor
-
Rate this paper

Recommended

No Data Available
No Data Available