We present a sensitivity-based predictor-corrector path-following algorithm for fast nonlinear model predictive control (NMPC) and demonstrate it on a large case study with an economic cost function. The path-following method is applied within the advanced-step NMPC framework to obtain fast and accurate approximate solutions of the NMPC problem. In our approach, we solve a sequence of quadratic programs to trace the optimal NMPC solution along a parameter change. A distinguishing feature of the path-following algorithm in this paper is that the strongly-active inequality constraints are included as equality constraints in the quadratic programs, while the weakly-active constraints are left as inequalities. This leads to close tracking of the optimal solution. The approach is applied to an economic NMPC case study consisting of a process with a reactor, a distillation column and a recycler. We compare the path-following NMPC solution with an ideal NMPC solution, which is obtained by solving the full nonlinear programming problem. Our simulations show that the proposed algorithm effectively traces the exact solution.
This paper proposes a computationally efficient algorithm for robust multistage model predictive control (MPC). In multistage scenario MPC, the evolution of uncertainty in the prediction horizon is represented via a scenario tree. The resulting large-scale optimization problem can be decomposed into several smaller subproblems where, for example, each subproblem solves a single scenario. Since the different scenarios differ only in the uncertain parameters, the distributed scenario MPC problem can be cast as a parametric nonlinear programming (NLP) problem. By using the NLP sensitivity, we do not need to solve all the subproblems as full NLPs. Instead they can be solved exploiting the parametric nature by a path-following predictor-corrector algorithm that approximates the NLP. This results in a computationally efficient multistage scenario MPC framework. Simulation results show that the sensitivity-based distributed multistage MPC provides a very good approximation of the fully centralized scenario MPC.