Convex Maximization via Adjustable Robust Optimization

Aras Selvi, Aharon Ben-Tal, Ruud Brekelmans, Dick den Hertog

Abstract: Maximizing a convex function over convex constraints is an NP-hard problem in general. We prove that such a problem can be reformulated as an adjustable robust optimization (ARO) problem in which e...