Abstract
We address robust versions of combinatorial optimization problems, focusing on the uncorrelated ellipsoidal uncertainty case, which corresponds to so-called mean-variance optimization. We present a branch and bound-algorithm for such problems that uses lower bounds obtained from Lagrangean decomposition. This approach allows to separate the uncertainty aspect in the objective function from the combinatorial structure of the feasible set. We devise a combinatorial algorithm for solving the unrestricted binary subproblem efficiently, while the underlying combinatorial optimization problem can be addressed by any black box-solver. An experimental evaluation shows that our approach clearly outperforms other methods for mean-variance optimization when applied to robust shortest path problems and to risk-averse capital budgeting problems arising in portfolio optimization.
The first author has been supported by the German Research Foundation (DFG) under grant BU 2313/2. The third author has been supported by the German Federal Ministry of Economics and Technology within the 6th Energy Research Programme.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsReferences
Aissi, H., Bazgan, C., Vanderpooten, D.: Min-max and min-max regret versions of combinatorial optimization problems: a survey. Eur. J. Oper. Res. 197(2), 427–438 (2009)
Atamtürk, A., Narayanan, V.: Polymatroids and mean-risk minimization in discrete optimization. Oper. Res. Lett. 36(5), 618–622 (2008)
Cornuéjols, G., Tütüncü, R.: Optimization Methods in Finance. Mathematics, Finance, and Risk. Cambridge University Press, Cambridge (2006)
Guignard, M., Kim, S.: Lagrangean decomposition: a model yielding stronger lagrangean bounds. Math. Program. 39(2), 215–228 (1987)
Helmberg. C.: ConicBundle 0.3.11. Fakultät für Mathematik, Technische Universität Chemnitz (2012). http://www.tu-chemnitz.de/-helmberg/ConicBundle
Nikolova, E.: Approximation algorithms for reliable stochastic combinatorial optimization. In: Serna, M., Shaltiel, R., Jansen, K., Rolim, J. (eds.) APPROX 2010. LNCS, vol. 6302, pp. 338–351. Springer, Heidelberg (2010)
Max Shen, Z.-J., Coullard, C., Daskin, M.S.: A joint location-inventory model. Transp. Sci. 37(1), 40–55 (2003)
Stobbe, P., Krause, A.: Efficient minimization of decomposable submodular functions. CoRR, abs/1010.5511 (2010)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2014 Springer International Publishing Switzerland
About this paper
Cite this paper
Baumann, F., Buchheim, C., Ilyina, A. (2014). Lagrangean Decomposition for Mean-Variance Combinatorial Optimization. In: Fouilhoux, P., Gouveia, L., Mahjoub, A., Paschos, V. (eds) Combinatorial Optimization. ISCO 2014. Lecture Notes in Computer Science(), vol 8596. Springer, Cham. https://doi.org/10.1007/978-3-319-09174-7_6
Download citation
DOI: https://doi.org/10.1007/978-3-319-09174-7_6
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-09173-0
Online ISBN: 978-3-319-09174-7
eBook Packages: Computer ScienceComputer Science (R0)