A geometric branch and bound method for robust maximization of convex functions
From MaRDI portal
Publication:2052396
DOI10.1007/s10898-021-01038-7zbMath1481.90241arXiv1911.08719MaRDI QIDQ2052396
Publication date: 26 November 2021
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1911.08719
robust optimization; finite set of candidate functions; geometric branch and bound; maximization of convex functions
90C57: Polyhedral combinatorics, branch-and-bound, branch-and-cut
90C26: Nonconvex programming, global optimization
90C17: Robustness in mathematical programming
Uses Software