Pith. sign in

REVIEW 2 major objections 2 minor 31 references

Additional time-coupled constraints restore recursive feasibility in economic NMPC for microgrids when generator runtime and startup limits are enforced.

Reviewed by Pith at T0; open to challenge. T0 means a machine referee read the full paper against a public rubric. the ladder, T0–T4 →

T0 review · grok-4.3

2026-06-29 15:24 UTC pith:6FP3MEUA

load-bearing objection The paper shows a practical fix for recursive feasibility in economic NMPC when generator runtime and startup limits are added, using time-coupled constraints on top of a quadratic power-flow MIQCP, but stability still rests on an unchecked periodic dissipativity assumption. the 2 major comments →

arxiv 2605.27553 v1 pith:6FP3MEUA submitted 2026-05-26 math.OC cs.SYeess.SY

Economic Nonlinear Model Predictive Control for Microgrids with Generator Up and Downtime Constraints

classification math.OC cs.SYeess.SY
keywords economic NMPCmicrogrid controlmixed-integer quadratic programmingrecursive feasibilitygenerator runtime constraintsperiodic dissipativity
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved

The pith

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The paper replaces full AC power flow equations with convex quadratic approximations inside an economic NMPC formulation that also tracks discrete generator on/off decisions and their associated runtime and startup-count limits. Simple terminal constraints prove insufficient to keep the resulting MIQCP feasible from one step to the next. The authors therefore introduce extra time-coupled constraints that link decisions across the entire horizon and prove that these constraints restore recursive feasibility. Under the further assumption of periodic dissipativity they establish closed-loop stability. Numerical tests on a six-bus microgrid confirm that the scheme remains solvable in real time by standard MIQCP solvers.

Core claim

When generator runtime and startup-event constraints are present, standard terminal conditions no longer guarantee recursive feasibility of the economic NMPC scheme; a set of additional time-coupled constraints restores the feasibility property and, together with periodic dissipativity, yields asymptotic stability of the closed-loop system.

What carries the argument

The additional time-coupled constraints that enforce generator minimum up-time, minimum down-time, and maximum startup counts across the prediction horizon inside the MIQCP.

Load-bearing premise

The underlying system must satisfy periodic dissipativity for the stability proof to hold.

What would settle it

A concrete counter-example or simulation in which the proposed time-coupled constraints are active yet the closed-loop trajectory loses feasibility or diverges would falsify the recursive-feasibility and stability claims.

Watch this falsifier — get emailed when new claim-graph text bears on it.

If this is right

  • The resulting MIQCP remains solvable in seconds by off-the-shelf solvers such as CPLEX for realistic microgrid sizes.
  • Recursive feasibility holds for any initial state that satisfies the tightened constraint set at the first step.
  • Stability follows directly once periodic dissipativity is granted, without requiring a terminal cost or terminal region.
  • The same constraint-augmentation technique applies to any economic NMPC problem whose discrete dynamics include minimum dwell-time rules.

Where Pith is reading between the lines

These are editorial extensions of the paper, not claims the author makes directly.

  • The same time-coupling idea could be tested on larger networks or on problems that include battery degradation or demand-response decisions.
  • If periodic dissipativity fails in practice, one could still retain feasibility by periodically resetting the constraint set, at the price of possible performance loss.
  • The convex quadratic power-flow surrogate may introduce steady-state bias; comparing closed-loop cost against a full AC solver on the same trajectories would quantify that bias.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, simulated authors' rebuttal, and a circularity audit.

Referee Report

2 major / 2 minor

Summary. The paper develops an economic NMPC scheme for microgrid multistage OPF that incorporates generator runtime and startup constraints. It replaces the AC power-flow equations with convex quadratic approximations, yielding MIQCPs that are solved by off-the-shelf solvers such as CPLEX. The authors show that standard terminal constraints fail to guarantee recursive feasibility when runtime and startup limits are present, introduce additional time-coupled constraints to restore recursive feasibility, and prove this property. Stability is established under the external assumption of periodic dissipativity of the closed-loop system. The approach is illustrated on a 6-bus microgrid under varying demand profiles.

Significance. If the periodic dissipativity assumption can be verified or replaced by verifiable conditions, the work supplies a practical, computationally lighter route to economic NMPC for microgrids that respects discrete generator logic while retaining recursive-feasibility and stability guarantees. The explicit treatment of time-coupled runtime/startup constraints and the demonstration that simple terminal sets are insufficient are useful contributions for the mixed-integer economic MPC literature.

major comments (2)
  1. [Abstract / stability theorem] Abstract and the stability section: the asymptotic-stability claim is obtained only after invoking periodic dissipativity of the underlying system (with the added runtime/startup constraints) as an assumption; no verification, sufficient condition, or numerical check is supplied showing that the 6-bus quadratic power-flow model plus integer generator dynamics actually satisfies the required dissipativity inequality for the chosen stage cost and storage function. Because this assumption is load-bearing for the stability theorem, its lack of substantiation weakens the central theoretical guarantee.
  2. [Recursive feasibility section] The recursive-feasibility proof (section following the terminal-constraint discussion) establishes feasibility under the proposed time-coupled constraints, yet the manuscript does not quantify how the added constraints affect the feasible set size or the resulting sub-optimality gap relative to the original MINLP formulation.
minor comments (2)
  1. The quadratic power-flow approximation error is not quantified for the 6-bus test cases; a brief comparison of the approximated versus exact AC solutions at the reported operating points would strengthen the practical-tractability claim.
  2. Solver runtimes and iteration counts for the MIQCP instances are mentioned only qualitatively; tabulating these quantities across the demand scenarios would allow readers to assess real-time feasibility.

Simulated Author's Rebuttal

2 responses · 0 unresolved

We thank the referee for the constructive report and the positive assessment of the paper's contributions. We address each major comment below, indicating where revisions will be made.

read point-by-point responses
  1. Referee: [Abstract / stability theorem] Abstract and the stability section: the asymptotic-stability claim is obtained only after invoking periodic dissipativity of the underlying system (with the added runtime/startup constraints) as an assumption; no verification, sufficient condition, or numerical check is supplied showing that the 6-bus quadratic power-flow model plus integer generator dynamics actually satisfies the required dissipativity inequality for the chosen stage cost and storage function. Because this assumption is load-bearing for the stability theorem, its lack of substantiation weakens the central theoretical guarantee.

    Authors: We agree that the stability theorem rests on the periodic dissipativity assumption, which is stated explicitly in the manuscript as an external hypothesis (standard in economic NMPC literature to obtain stability without terminal penalties). No general sufficient condition is provided because dissipativity depends on the specific stage cost, storage function, and closed-loop dynamics, making a universal verifiable condition difficult to derive. For the 6-bus example, a numerical check could be performed by simulating the closed-loop trajectories under the proposed NMPC and verifying the dissipativity inequality over one or more periods, but this was omitted to keep the focus on the feasibility result and the mixed-integer aspects. We will revise the stability section and abstract to clarify the assumption's role, add a short remark on how it can be checked numerically for concrete instances, and note that verification for the reported simulations is feasible but left implicit. revision: partial

  2. Referee: [Recursive feasibility section] The recursive-feasibility proof (section following the terminal-constraint discussion) establishes feasibility under the proposed time-coupled constraints, yet the manuscript does not quantify how the added constraints affect the feasible set size or the resulting sub-optimality gap relative to the original MINLP formulation.

    Authors: The recursive-feasibility proof is deliberately focused on showing that the proposed time-coupled constraints restore the property that standard terminal sets lose when runtime and startup limits are present. Quantifying the reduction in feasible-set volume or the increase in cost relative to the original (non-convex) MINLP is a separate question that would require either set-theoretic volume estimates or extensive Monte-Carlo comparisons of optimal values; such analysis is outside the scope of the current contribution, which centers on feasibility guarantees for the MIQCP approximation. The quadratic relaxation already introduces its own sub-optimality relative to the full AC-MINLP, and the added constraints are a minimal augmentation needed for feasibility. We will add a brief remark in the recursive-feasibility section acknowledging the potential conservatism without providing a full quantification, as the latter would substantially expand the paper. revision: partial

Circularity Check

0 steps flagged

No significant circularity; stability conditional on external assumption

full rationale

The paper derives recursive feasibility of the NMPC scheme via added time-coupled constraints on generator runtime and startups, proving the property directly from the MIQCP formulation. Stability is stated under the separate assumption of periodic dissipativity of the underlying system (quadratic power-flow plus integer dynamics), without deriving that property from the controller equations, fitting parameters to data, or reducing to self-citations. No load-bearing step renames a fit as a prediction or imports uniqueness via author-overlapping citations. The central claims remain independent of the inputs.

Axiom & Free-Parameter Ledger

0 free parameters · 1 axioms · 0 invented entities

The central stability claim rests on one domain assumption; the convex quadratic replacement is a deliberate modeling choice rather than a derived result. No free parameters or new entities are introduced in the abstract.

axioms (1)
  • domain assumption periodic dissipativity of the underlying system
    Invoked explicitly to prove stability of the NMPC controller.

pith-pipeline@v0.9.1-grok · 5766 in / 1349 out tokens · 36886 ms · 2026-06-29T15:24:11.656700+00:00 · methodology

0 comments
read the original abstract

Recently there has been a lot of progress in the development of economic nonlinear model predictive control (NMPC) schemes for multistage optimal power flow (OPF) problems. However, the additional inclusion of discrete decision variables to model generator runtimes and generator startup costs can amount to large scale mixed-integer nonlinear programs (MINLPs) that are computationally very challenging. This work investigates the practical approach that replaces the nonlinear AC power flow equations by convex quadratic approximations. In combination with the discrete generator dynamics this leads to a mixed-integer quadratically constrained program (MIQCP) which is of significantly lower complexity and can be solved in reasonable time by off-the-shelf solvers such as CPLEX. We further show that simple terminal constraints are not sufficient to guarantee recursive feasibility of the NMPC scheme if constraints on generator runtime and on the number of generator startup events are present. To address this challenge we propose the use of additional time-coupled constraints and prove the resulting recursive feasibility property. Based on the assumption of periodic dissipativity of the underlying system we can prove stability of the proposed controller. To illustrate our results, we present simulations of a realistic 6-bus microgrid under different demand scenarios.

Figures

Figures reproduced from arXiv: 2605.27553 by Amer Mesanovic, Armin Nurkanovic, Ekaterina Kostina, Hans Georg Bock, J\"urgen Gutekunst, Robert Scholz.

Figure 1
Figure 1. Figure 1: Illustration of the product xy and the McCormick tetrahedron shaped envelope defined by the four linear in￾equalities with the bounds x, y P r0, 2s. • Square terms For pure quadratic terms x 2 the lower bounds of the McCormick envelope can be improved by a stronger convex quadratic constraint leading to the convex envelope defined by x|2 ě x 2 , x|2 ď px ` xqx ´ xx. • Trigonometric terms The trigonometric … view at source ↗
Figure 2
Figure 2. Figure 2: Topology of the test microgrid. 15 [PITH_FULL_IMAGE:figures/full_fig_p015_2.png] view at source ↗
Figure 3
Figure 3. Figure 3: Closed-loop trajectory in the nominal case. The generator and batteries follow the periodic reference solu [PITH_FULL_IMAGE:figures/full_fig_p017_3.png] view at source ↗
Figure 4
Figure 4. Figure 4: Closed-loop trajectory for the varying solar input scenario. The dashed lines represent the periodic reference [PITH_FULL_IMAGE:figures/full_fig_p018_4.png] view at source ↗

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Reference graph

Works this paper leans on

31 extracted references

  1. [1]

    and Andersson, G

    Arnold, M. and Andersson, G. (2010). Investigating renewable infeed in residential areas applying model predictive control. InIEEE PES General Meeting, pages 1–8

  2. [2]

    Bai, X., Wei, H., Fujisawa, K., and Wang, Y . (2008). Semidefinite programming for optimal power flow problems. International Journal of Electrical Power & Energy Systems, 30(6-7):383–392

  3. [3]

    Balke, J. (2014). Integration of renewable energy in europe. Technical Report 9011-700, European Energy Agency

  4. [4]

    Brinkman, G., Bain, D., Buster, G., Draxl, C., Das, P., Hon, J., Ibanez, E., et al. (2021). The north american renew- able integration study: A u.s. perspective. Technical Report NREL/TP-6A20-79224, National Renewable Energy Laboratory (NREL)

  5. [5]

    Chen, H., Chen, J., and Duan, X. (2005). Multi-stage dynamic optimal power flow in wind power integrated system. In2005 IEEE/PES Transmission Distribution Conference Exposition: Asia and Pacific, pages 1–5

  6. [6]

    L., and Van Hentenryck, P

    Coffrin, C., Hijazi, H. L., and Van Hentenryck, P. (2016). The qc relaxation: A theoretical and computational study on optimal power flow.IEEE Transactions on Power Systems, 31(4):3008–3018

  7. [7]

    Dakin, R. J. (1965). A tree-search algorithm for mixed integer programming problems.The Computer Journal, 8(3):250–255

  8. [8]

    R., Low, S

    Farivar, M., Clarke, C. R., Low, S. H., and Chandy, K. M. (2011). Inverter var control for distribution systems with renewables.2011 IEEE International Conference on Smart Grid Communications (SmartGridComm)

  9. [9]

    and Engelmann, A

    Faulwasser, T. and Engelmann, A. (2020). Toward economic nmpc for multistage ac optimal power flow.Optimal Control Applications and Methods, 41(1):107–127

  10. [10]

    Faulwasser, T., Engelmann, A., M¨uhlpfordt, T., and Hagenmeyer, V . (2018). Optimal power flow: an introduction to predictive, distributed and stochastic control challenges.at - Automatisierungstechnik, 66(7):573–589

  11. [11]

    N., and Bonvin, D

    Faulwasser, T., Korda, M., Jones, C. N., and Bonvin, D. (2014). Turnpike and dissipativity properties in dynamic real-time optimization and economic mpc. In53rd IEEE Conference on Decision and Control, pages 2734–2739

  12. [12]

    and Murray, A

    Faulwasser, T. and Murray, A. (2020). Turnpike properties in discrete-time mixed-integer optimal control.IEEE Control Systems Letters, 4(3):704–709. Gr¨une, L. and M ¨uller, M. A. (2016). On the relation between strict dissipativity and turnpike properties.Systems & Control Letters, 90:45–53. Gurobi Optimization, LLC (2021). Gurobi Optimizer Reference Manual

  13. [13]

    G., and Kostina, E

    Gutekunst, J., Scholz, R., Nurkanovi´c, A., Meˇsanovi´c, A., Bock, H. G., and Kostina, E. (2020). Fast moving horizon estimation using multi-level iterations for microgrid control.at - Automatisierungstechnik, 68(12):1059–1076

  14. [14]

    Hijazi, H., Coffrin, C., and Hentenryck, P. V . (2016). Convex quadratic relaxations for mixed-integer nonlinear pro- grams in power systems.Mathematical Programming Computation, 9(3):321–367. IBM ILOG CPLEX (2019). V12.10: User’s manual for cplex. International Business Machines Corporation

  15. [15]

    Jabr, R. (2006). Radial distribution load flow using conic programming.IEEE Transactions on Power Systems, 21(3):1458–1459

  16. [16]

    (2011).Fast Numerical Methods for Mixed-Integer Nonlinear Model-Predictive Control

    Kirches, C. (2011).Fast Numerical Methods for Mixed-Integer Nonlinear Model-Predictive Control. Vieweg+Teubner Verlag

  17. [17]

    and Low, S

    Lavaei, J. and Low, S. H. (2012). Zero duality gap in optimal power flow problem.IEEE Transactions on Power Systems, 27(1):92–107. 19 Economic NMPC for Microgrids with Generator Up/Downtime Constraints

  18. [18]

    Leyffer, S. (2001). Integrating sqp and branch-and-bound for mixed integer nonlinear programming.Computational optimization and applications, 18(3):295–309

  19. [19]

    and D¨using, R

    Meier, G. and D¨using, R. (1992). Zur modellierung logischer aussagen erg ¨anzend zu linearen programmen: Grundla- gen und entwurfs¨uberlegungen f¨ur einen modellgenerator.OR Spektrum, 14(3):149–160. Meyer-H¨ubner, N., Suriyah, M., Leibfried, T., Slednev, V ., Bertsch, V ., Fichtner, W., Gerstner, P., Schick, M., and

  20. [20]

    Heuveline, V . (2017). Optimal storage operation with model predictive control in the german transmission grid. In Trends in Mathematics, pages 31–45. Springer International Publishing. M¨uller, M. A., Angeli, D., and Allg ¨ower, F. (2015). On necessity and robustness of dissipativity in economic model predictive control.IEEE Transactions on Automatic Con...

  21. [21]

    Nurkanovic, A., Zanelli, A., Albrecht, S., and Diehl, M. (2019). The advanced step real time iteration for NMPC. In 2019 IEEE 58th Conference on Decision and Control (CDC). IEEE

  22. [22]

    E., Ca ˜nizares, C

    Olivares, D. E., Ca ˜nizares, C. A., and Kazerani, M. (2014). A centralized energy management system for isolated microgrids.IEEE Transactions on Smart Grid, 5(4):1864–1875

  23. [23]

    E., Lara, J

    Olivares, D. E., Lara, J. D., Ca ˜nizares, C. A., and Kazerani, M. (2015). Stochastic-predictive energy management system for isolated microgrids.IEEE Transactions on Smart Grid, 6(6):2681–2693

  24. [24]

    Pereira, M., Limon, D., Mu ˜noz de la Pe ˜na, D., Valverde, L., and Alamo, T. (2015). Periodic economic control of a nonisolated microgrid.IEEE Transactions on Industrial Electronics, 62(8):5247–5255

  25. [25]

    Ross, D. W. and Kim, S. (1980). Dynamic economic dispatch of generation.IEEE Transactions on Power Apparatus and Systems, PAS-99(6):2060–2068

  26. [26]

    Potschka, H

    Scholz, R., Nurkanovi ´c, A., Me ˇsanovi´c, A., Gutekunst, J., A. Potschka, H. B., and Kostina, E. (2020). Multi-level iterations for microgrid control with automatic level choice. InScientific Computing in Electrical Engineering. Springer International Publishing

  27. [27]

    Shanno, D. F. and Weil, R. L. (1971). Technical note—“linear” programming with absolute-value functionals.Oper- ations Research, 19(1):120–124

  28. [28]

    Strenge, L., Jing, X., Boersma, R., Schultz, P., Hellmann, F., Kurths, J., Raisch, J., and Seel, T. (2020). Iterative learning control in prosumer-based microgrids with hierarchical control.IFAC-PapersOnLine, 53(2):12251–12258

  29. [29]

    R., Madhusudan, S., Nagarajan, V

    Tamilselvi, S., Gunasundari, S., Karuppiah, N., RK, A. R., Madhusudan, S., Nagarajan, V . M., Sathish, T., Shamim, M. Z. M., Saleel, C. A., and Afzal, A. (2021). A review on battery modelling techniques.Sustainability, 13(18):10042

  30. [30]

    and Elaiw, A

    Xia, X. and Elaiw, A. (2010). Optimal dynamic economic dispatch of generation: A review.Electric Power Systems Research, 80(8):975–986

  31. [31]

    Zanon, M., Gr ¨une, L., and Diehl, M. (2017). Periodic optimal control, dissipativity and mpc.IEEE Transactions on Automatic Control, 62(6):2943–2949. 20