EconPapers    
Economics at your fingertips  
 

A geometric branch and bound method for robust maximization of convex functions

Fengqiao Luo () and Sanjay Mehrotra ()
Additional contact information
Fengqiao Luo: Northwestern University
Sanjay Mehrotra: Northwestern University

Journal of Global Optimization, 2021, vol. 81, issue 4, No 1, 835-859

Abstract: Abstract We investigate robust optimization problems defined for maximizing convex functions. While the problems arise in situations which are naturally modeled as minimization of concave functions, they also arise when a decision maker takes an optimistic approach to making decisions with convex functions. For finite uncertainty set, we develop a geometric branch-and-bound algorithmic approach to solve this problem. The geometric branch-and-bound algorithm performs sequential piecewise-linear approximations of the convex objective, and solves linear programs to determine lower and upper bounds at each node. Finite convergence of the algorithm to an $$\epsilon -$$ ϵ - optimal solution is proved. Numerical results are used to discuss the performance of the developed algorithm. The algorithm developed in this paper can be used as an oracle in the cutting surface method for solving robust optimization problems with compact ambiguity sets.

Keywords: Robust optimization; Maximization of convex functions; Finite set of candidate functions; Geometric branch and bound (search for similar items in EconPapers)
Date: 2021
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://link.springer.com/10.1007/s10898-021-01038-7 Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:jglopt:v:81:y:2021:i:4:d:10.1007_s10898-021-01038-7

Ordering information: This journal article can be ordered from
http://www.springer. ... search/journal/10898

DOI: 10.1007/s10898-021-01038-7

Access Statistics for this article

Journal of Global Optimization is currently edited by Sergiy Butenko

More articles in Journal of Global Optimization from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().

 
Page updated 2025-03-20
Handle: RePEc:spr:jglopt:v:81:y:2021:i:4:d:10.1007_s10898-021-01038-7