CORTEXA
← Browse
arxivmath.OCcs.MSeess.SY2026-07-20

$\texttt{codesign-mcdp}$: A Python Library for Monotone Co-Design Problems

Corentin Briat

$\texttt{codesign-mcdp}$ is a Python library for formulating and solving $\textit{Monotone Co-Design Problems}$ (MCDPs) in the framework of Censi (2015). A design problem is a relation between two posets, a functionality poset $F$ and a resource poset $R$; given a target functionality, the problem asks for the antichain of minimal resources needed to deliver it. Design problems compose under three operators (series, parallel, feedback), and the resulting class is closed under composition. The library implements the antichain calculus, six primitive design-problem types, the three composition operators, a Kleene fixed-point solver, and two high-level builders (an MCDPL-style declarative builder and a modular $\texttt{System}$ builder). Further layers add set-based and stochastic uncertainty, compositional online learning, and temporal, vector-state, and online co-design, alongside a suite of worked examples.

View free PDFSource page

Related papers

arxiveess.SYmath.DSmath.OC2026-07-06

Pathological Regimes of Closed-Loop Recommendation Systems over Social Networks

Mariano Simone, Frasca Paolo

This paper addresses the problem of designing recommendation systems for social networks and e-commerce platforms from a control-theoretic perspective. We formulate recommendation design as an infinite-horizon state-feedback optimal control problem whose performance index rewards…

View free PDFSource page
arxivmath.OCeess.SY2026-07-01

Experiment Design for Set-membership Identification: From Prior Knowledge to Universal Inputs

Amir Shakouri, Henk J. van Waarde, M. Kanat Camlibel

We consider the problem of designing input signals for an unknown linear time-invariant system in such a way that the resulting data, within a finite horizon, is suitable for identification with a desired accuracy. We consider both noise-free and noisy settings with $\ell_\infty$…

View free PDFSource page
arxivmath.OCeess.SY2026-07-21

Optimization models and algorithms for the Unit Commitment problem

Javal Vyas, Carl Laird, Ignacio E. Grossmann, Ricardo M. Lima, Iiro Harjunkoski, Jan Poland

The unit commitment problem determines the optimal strategy to meet the electricity demand at minimum cost by committing power generation units at each point of time. Solving the unit commitment problem gives rise to a challenging optimization problem due to its combinatorial com…

View free PDFSource page
arxivmath.OCcs.CEeess.SY2026-07-20

Supply Chain Networks

Elioth Sanabria

This study provides a quantitative framework for analysis of systemic demand uncertainty and risk propagation cascades across general supply chain networks. By leveraging properties derived from stochastic networks embedded within a Newsvendor paradigm, we model multi-echelon net…

View free PDFSource page
arxivcs.CEeess.SYmath.OC2026-07-01

Generalized Normal Constraint (GNC): A Complete Geometric Generalization of the NNC Method

Achille Messac, Blayne Montaque

This paper presents a unified geometric, mathematical, and computational framework for the generation of the $complete$ admissible Pareto frontier. Several existing methods are structurally unable to capture the complete admissible Pareto frontier. These include widely used metho…

View free PDFSource page