We apply the basic principles underlying combinatorial integral approximation methods for mixed-integer optimal control with ordinary differential equations in general, and the sum-up rounding algorithm specifically, to optimization problems with partial differential equation (PDE) constraints. By doing so, we identify two possible generalizations that are applicable to problems involving PDE constraints with mesh-dependent integer variables, by minimizing errors in the PDE solution either pointwise or according to Hilbert-like norms and seminorms. We develop the theoretical underpinnings of these methods and formulate several variants. We apply these variants to 110 randomized instances of two test problems: 100 instances of a linear-quadratic distributed control problem and 10 instances of a nonlinear topology optimization problem. We show that, especially in the case of Hilbert-like approximation methods, our approach can deliver high-quality integer solutions in substantially less time than an exact branch-and-bound solver would take.

## Citation

Hahn, Mirko and Sager, Sebastian. "Combinatorial Integral Approximation for Mixed-Integer PDE-Constrained Optimization Problems", Argonne National Laboratory, Preprint ANL/MCS-P9037-0118

## Article

View Combinatorial Integral Approximation for Mixed-Integer PDE-Constrained Optimization Problems