Extended formulations for binary optimal control problems

DOI10.1007/S10107-024-02162-4MaRDI QIDQ6932172zbMATH OpenFDO

Authors Christoph Buchheim

Publication date 9 September 2025

Published in Mathematical Programming. Series A. Series B (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1007/S10107-024-02162-4

zbMATH Keywords

binary optimal controlconvexificationextended formulationsswitching time optimization

Mathematics Subject Classification ID

Optimality conditions for free problems in two or more independent variables (49K10)

Cites work

• Combinatorial integral approximation
• Extended formulations in combinatorial optimization
• Functional analysis, Sobolev spaces and partial differential equations
• Linear functional analysis. An application-oriented introduction. Translated from the 6th German edition by Robert Nürnberg
• Min-up/min-down polytopes
• On mixed-integer optimal control with constrained total variation of the integer control
• Parabolic optimal control problems with combinatorial switching constraints. I: Convex relaxations
• Parabolic optimal control problems with combinatorial switching constraints. II: Outer approximation algorithm
• Reducibility among combinatorial problems
• The min-up/min-down unit commitment polytope
• The polytope of binary sequences with bounded variation
• Variational Analysis in Sobolev and BV Spaces

Cited in

(1)

• Extended formulations for control languages defined by finite-state automata

This page was built for publication: Extended formulations for binary optimal control problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6932172)