pith. sign in

arxiv: 2604.13215 · v1 · submitted 2026-04-14 · 📡 eess.SY · cs.SY

A Control Co-Design Framework to Achieve Solution Feasibility in Energy System Optimization Problems

Tania Rifat Jahan , Donald J. Docimo This is my paper

Pith reviewed 2026-05-10 14:19 UTC · model grok-4.3

classification 📡 eess.SY cs.SY
keywords control co-designoptimization feasibilityenergy systemsconstraint relaxationmicrogrid designbattery sizinginfeasible problems
0
0 comments X

The pith

A ranking procedure on performance metric bounds turns infeasible control co-design problems for energy systems into solvable ones by relaxing only a few constraints.

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

This paper addresses the common problem of infeasible optimization results when using control co-design to size both plant and controller in energy systems. It introduces a systematic way to rank the upper and lower bounds on system metrics according to their likelihood of being the cause of infeasibility. The ranking then directs the selective relaxation of a small subset of those bounds while leaving the rest of the problem unchanged. The method is tested on the design of a battery energy storage system inside a microgrid and requires fewer iterations than a generic relaxation baseline to reach a feasible solution.

Core claim

The paper establishes that, for a class of control co-design problems in energy systems, ordering metric bounds from least to most likely to produce infeasibility supplies an algorithmic rule for relaxing a limited number of constraints. This converts an originally infeasible nonlinear program into a feasible one while preserving the structure and most of the original design specifications, as shown by the successful solution of a battery sizing problem that a baseline approach also solves but only after more iterations.

What carries the argument

The ranking procedure for metric bounds, which orders them by estimated likelihood of causing infeasibility to select the minimal set for relaxation.

If this is right

  • Previously unsolvable CCD problems in energy systems become solvable while keeping most constraints untouched.
  • The number of iterations required to reach feasibility drops compared with uniform relaxation methods.
  • Designers receive explicit guidance on which performance bounds to adjust first.
  • The overall problem structure and objective remain close to the original formulation.

Where Pith is reading between the lines

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

  • The same ranking logic could be tested on CCD problems outside energy systems, such as vehicle or building control co-design.
  • If the ranking proves robust, it might reduce the need for manual constraint tuning in other nonlinear optimization settings.
  • The framework implicitly assumes bounds can be relaxed independently; correlated bounds might require a joint-ranking extension.

Load-bearing premise

The ranking correctly identifies which bounds can be relaxed without producing designs that fail to meet the original energy-system goals in practice.

What would settle it

Running the framework on the microgrid battery problem and obtaining a feasible design whose performance metrics violate one or more key original requirements that the ranking had labeled as safe to relax.

Figures

Figures reproduced from arXiv: 2604.13215 by Donald J. Docimo, Tania Rifat Jahan.

Figure 5
Figure 5. Figure 5: presents the number of metrics within their bounds per trial of the baseline approach. Table II provides a detailed numerical snapshot of this data for 10 representative trials, highlighting the metrics within their bounds [PITH_FULL_IMAGE:figures/full_fig_p005_5.png] view at source ↗
Figure 6
Figure 6. Figure 6: Metric values for the baseline approach, trial 50. [PITH_FULL_IMAGE:figures/full_fig_p006_6.png] view at source ↗
read the original abstract

This work explores methods to identify energy system designs for infeasible control co-design optimization problems. Control co-design, or CCD, has been recognized as a powerful tool to maximize energy system capabilities through simultaneous determination of plant and controller parameters. However, due to the inherent nonlinearities, complexity, and conflicting criteria of energy systems, CCD optimization problems are susceptible to infeasibility and can lack potential solutions. While transforming the optimization problem by relaxing constraints has been developed for optimal control infeasibility challenges, solution feasibility for CCD is relatively unexplored. This paper proposes a framework to convert infeasible optimization problems into solvable forms for a class of CCD problems. The framework introduces a procedure to rank metric bounds from least likely to most likely to cause infeasibility. This provides guidance to algorithmically relax a limited number of constraints, leaving others intact. The proposed framework is applied to a CCD problem for designing a battery within a microgrid. Comparison against a baseline approach for relaxing optimization problems shows the framework requires only a reduced number of iterations to determine a solution.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, simulated authors' rebuttal, and a circularity audit. Tearing a paper down is the easy half of reading it; the pith above is the substance, this is the friction.

Referee Report

2 major / 2 minor

Summary. The paper proposes a framework for converting infeasible control co-design (CCD) optimization problems in energy systems into solvable forms by ranking metric bounds from least to most likely to cause infeasibility and then relaxing a limited number of constraints. The approach is demonstrated on a CCD problem for battery design in a microgrid, where it requires fewer iterations than a baseline relaxation method.

Significance. If the ranking procedure can be shown to be grounded in the problem structure and to preserve meaningful designs, the framework would address a practical challenge in CCD for energy systems, where nonlinearities and conflicting objectives frequently lead to infeasibility. The reported reduction in iterations on the microgrid example indicates potential computational benefits, though broader validation would be needed to establish general utility.

major comments (2)
  1. [Abstract and method description] The ranking procedure for metric bounds is described only at a high level (ranking from least to most likely to cause infeasibility) without a specified mathematical basis, sensitivity metric, dual information, or optimality condition. This procedure is load-bearing for the central claim that the framework systematically restores feasibility while preserving design intent.
  2. [Numerical example / microgrid application] The microgrid comparison reports fewer iterations than the baseline but provides no quantitative assessment of how close the relaxed solution remains to the original metric targets, whether plant/controller parameters stay physically realizable, or validation metrics for solution quality post-relaxation. This limits support for the claim that the relaxed designs remain useful for the original energy-system goals.
minor comments (2)
  1. [Method] Notation for the metric bounds and relaxation variables should be introduced with explicit definitions and consistent usage across the framework description.
  2. [Numerical results] The baseline relaxation approach used for comparison should be described in sufficient detail (including any parameters or heuristics) to allow reproducibility of the iteration-count results.

Simulated Author's Rebuttal

2 responses · 0 unresolved

We thank the referee for the constructive and detailed review. We address each major comment below, indicating where revisions will be made to strengthen the manuscript.

read point-by-point responses

  1. Referee: [Abstract and method description] The ranking procedure for metric bounds is described only at a high level (ranking from least to most likely to cause infeasibility) without a specified mathematical basis, sensitivity metric, dual information, or optimality condition. This procedure is load-bearing for the central claim that the framework systematically restores feasibility while preserving design intent.

    Authors: We agree that the ranking procedure requires a more explicit mathematical foundation in the manuscript. The current description is intentionally concise, but we will revise the methods section to specify the sensitivity metric (normalized constraint violation from an initial solve) used for ranking, along with its derivation from first-order sensitivity information and relation to dual multipliers. This will demonstrate how the ranking systematically identifies the minimal set of relaxations while preserving design intent, directly addressing the load-bearing aspect of the central claim. revision: yes

  2. Referee: [Numerical example / microgrid application] The microgrid comparison reports fewer iterations than the baseline but provides no quantitative assessment of how close the relaxed solution remains to the original metric targets, whether plant/controller parameters stay physically realizable, or validation metrics for solution quality post-relaxation. This limits support for the claim that the relaxed designs remain useful for the original energy-system goals.

    Authors: We concur that the numerical results section would be strengthened by additional quantitative assessments. In the revision, we will add explicit measures of deviation from the original metric targets (e.g., percentage relaxation applied), confirmation that all resulting plant and controller parameters remain within physically realizable bounds, and post-relaxation validation metrics including simulated microgrid performance (energy throughput, reliability indices) and objective value comparisons relative to the infeasible original problem. These will better substantiate the utility of the obtained designs. revision: yes

Circularity Check

0 steps flagged

No circularity: framework and ranking procedure are presented as independent algorithmic contributions without reduction to inputs or self-citations.

full rationale

The paper proposes a new framework for handling infeasibility in CCD optimization problems by introducing a ranking procedure for metric bounds. No equations or steps in the abstract or described content reduce by construction to fitted parameters, self-definitions, or prior self-citations. The procedure is described as an original algorithmic contribution applied to a microgrid example, with comparison to a baseline, and does not rely on load-bearing self-citations or ansatzes imported from the authors' prior work. The derivation chain remains self-contained against external benchmarks.

Axiom & Free-Parameter Ledger

0 free parameters · 1 axioms · 0 invented entities

The framework rests on the domain assumption that CCD problems in energy systems form a class where infeasibility stems from a limited number of identifiable metric bounds that can be ranked and relaxed without destroying the problem's utility.

axioms (1)
  • domain assumption CCD optimization problems belong to a class where infeasibility can be resolved by relaxing a limited number of metric bounds after ranking them by likelihood of causing the infeasibility.
    Stated in the abstract as the basis for the proposed framework.

pith-pipeline@v0.9.0 · 5481 in / 1228 out tokens · 29582 ms · 2026-05-10T14:19:17.103375+00:00 · methodology

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

20 extracted references · 20 canonical work pages

  1. [1]

    On the coupling between the plant and controller optimization problems,

    H. K. Fathy, J. A. Reyer, P. Y. Papalambros, and A. G. Ulsoy, “On the coupling between the plant and controller optimization problems,” in Proceedings of the American Control Conference , 2001, pp. 1864 – 1869

    work page 2001

  2. [2]

    Control Co-Design: An engineering game changer,

    M. Garcia-Sanz, “Control Co-Design: An engineering game changer,” Advanced Control for Applications: Engineering and Industrial Systems, vol. 1, no. 1, Dec. 2019

    work page 2019

  3. [3]

    Combined Plant and Control Co -Design for Robust Disturbance Rejection in Thermal -Fluid Systems,

    A. L. Nash and N. Jain, “Combined Plant and Control Co -Design for Robust Disturbance Rejection in Thermal -Fluid Systems,” IEEE Transactions on Control Systems Technology, vol. 28, no. 6, pp. 2532– 2539, 2019

    work page 2019

  4. [4]

    An Approach to Simultaneous Topology, Parametric, and Feedback Control Co-design: Applications to Conservation-Based Energy Systems,

    C. T. Aksland and A. G. Alleyne, “An Approach to Simultaneous Topology, Parametric, and Feedback Control Co-design: Applications to Conservation-Based Energy Systems,” IEEE Control Syst., vol. 45, no. 3, pp. 28–55, 2025

    work page 2025

  5. [5]

    Closed - Loop Control and Plant Co-Design of a Hybrid Electric Unmanned Air Vehicle,

    C. T. Aksland, D. L. Clark, C. A. Lupp, and A. G. Alleyne, “Closed - Loop Control and Plant Co-Design of a Hybrid Electric Unmanned Air Vehicle,” Journal of Dynamic Systems, Measurement and Control, Transactions of the ASME, vol. 146, no. 1, Jan. 2024

    work page 2024

  6. [6]

    Power management and design optimization of fuel cell/battery hybrid vehicles,

    M. J. Kim and H. Peng, “Power management and design optimization of fuel cell/battery hybrid vehicles,” J. Power Sources, vol. 165, no. 2, pp. 819–832, Mar. 2007

    work page 2007

  7. [7]

    Control Co -Design of Wind Turbines,

    L. Y. Pao, M. Pusch, and D. S. Zalkind, “Control Co -Design of Wind Turbines,” Annu. Rev. Control Robot. Auton. Syst., vol. 7, p. 17, 2024

    work page 2024

  8. [8]

    Control Co-Design for Rotor Blades of Floating Offshore Wind Turbines,

    X. Du, L. Burlion, and O. Bilgen, “Control Co-Design for Rotor Blades of Floating Offshore Wind Turbines,” in ASME International Mechanical Engineering Congress and Exposition, 2020

    work page 2020

  9. [9]

    Reliability-based control co-design of horizontal axis wind turbines,

    T. Cui, J. T. Allison, and P. Wang, “Reliability-based control co-design of horizontal axis wind turbines,” Structural and Multidisciplinary Optimization, vol. 64, no. 6, pp. 3653–3679, Dec. 2021

    work page 2021

  10. [10]

    Multi-Objective Control Co-design Using Graph Based Optimization for Offshore Wind Farm Grid Integration,

    H. Sharma, W. Wang, B. Huang, T. Ramachandran, and V. Adetola, “Multi-Objective Control Co-design Using Graph Based Optimization for Offshore Wind Farm Grid Integration,” IEEE, 2024

    work page 2024

  11. [11]

    Control co -design of commercial building chiller plant using Bayesian optimization,

    A. Bhattacharya, S. Vasisht, V. Adetola, S. Huang, H. Sharma, and D. L. Vrabie, “Control co -design of commercial building chiller plant using Bayesian optimization,” Energy Build., vol. 246, Sep. 2021

    work page 2021

  12. [12]

    A multiobjective optimization -based evolutionary algorithm for constrained optimization,

    Z. Cai and Y. Wang, “A multiobjective optimization -based evolutionary algorithm for constrained optimization,” IEEE Transactions on Evolutionary Computation , vol. 10, no. 6, pp. 658 – 675, 2006

    work page 2006

  13. [13]

    A generic framework for constrained optimization using genetic algorithms,

    S. Venkatraman and G. G. Yen, “A generic framework for constrained optimization using genetic algorithms,” IEEE Transactions on Evolutionary Computation, vol. 9, no. 4, pp. 424–435, Aug. 2005

    work page 2005

  14. [14]

    Infeasibility Detection and SQP Methods for Nonlinear Optimization,

    R. Byrd, Frank. Curtis, and J. Nocedal, “Infeasibility Detection and SQP Methods for Nonlinear Optimization,” SIAM Journal on Optimization, vol. 20, no. 5, pp. 2281–2299, 2010

    work page 2010

  15. [15]

    On utilizing infeasibility in multiobjective evolutionary algorithms,

    T. Hanne, “On utilizing infeasibility in multiobjective evolutionary algorithms,” Springer, 2009, pp. 113–122

    work page 2009

  16. [16]

    Infeasible and Critically Feasible Optimal Control,

    R. S. Burachik, C. Y. Kaya, and W. M. Moursi, “Infeasible and Critically Feasible Optimal Control,” J. Optim. Theory Appl., vol. 203, no. 2, pp. 1219–1245, 2024

    work page 2024

  17. [17]

    Optimal Scheduling of Microgrid Using Constrained Multi -Objective Optimization with Additional Objectives,

    Y. Hua, B. Liao, H. Zhang, L. Liu, Y. Li, and Y. Yang, “Optimal Scheduling of Microgrid Using Constrained Multi -Objective Optimization with Additional Objectives,” in 2024 6th International Conference on Data-driven Optimization of Complex Systems (DOCS), 2024, pp. 501–506

    work page 2024

  18. [18]

    Feasibility Detection for Nested Codesign of Hypersonic Vehicles,

    C. Van Der Heide, P. Cudmore, I. Jahn, V. Bone, P. M. Dower, and C. Manzie, “Feasibility Detection for Nested Codesign of Hypersonic Vehicles,” in 2023 62nd IEEE Conference on Decision and Control (CDC), IEEE, 2023, pp. 632–637

    work page 2023

  19. [19]

    A Study on Control Co-Design for Optimizing Microgrid Sustainability,

    T. R. Jahan, A. S. Ouedraogo, and D. J. Docimo, “A Study on Control Co-Design for Optimizing Microgrid Sustainability,” IFAC- PapersOnLine, vol. 58, no. 28, pp. 636–641, 2024

    work page 2024

  20. [20]

    GHG Emissions from the production of lithium-ion batteries for electric vehicles in China,

    H. Hao, Z. Mu, S. Jiang, Z. Liu, and F. Zhao, “GHG Emissions from the production of lithium-ion batteries for electric vehicles in China,” Sustainability, vol. 9, no. 4, p. 504, 2017. Figure 6. Metric values for the baseline approach, trial 50

    work page 2017