Lagrangean Decomposition for Mean-Variance Combinatorial Optimization

  • Frank Baumann
  • Christoph Buchheim
  • Anna IlyinaEmail author
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 8596)


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.


Robust combinatorial optimization Mean-risk optimization Lagrangean decomposition 


  1. 1.
    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)CrossRefzbMATHMathSciNetGoogle Scholar
  2. 2.
    Atamtürk, A., Narayanan, V.: Polymatroids and mean-risk minimization in discrete optimization. Oper. Res. Lett. 36(5), 618–622 (2008)CrossRefzbMATHMathSciNetGoogle Scholar
  3. 3.
    Cornuéjols, G., Tütüncü, R.: Optimization Methods in Finance. Mathematics, Finance, and Risk. Cambridge University Press, Cambridge (2006)CrossRefGoogle Scholar
  4. 4.
    Guignard, M., Kim, S.: Lagrangean decomposition: a model yielding stronger lagrangean bounds. Math. Program. 39(2), 215–228 (1987)CrossRefzbMATHMathSciNetGoogle Scholar
  5. 5.
    Helmberg. C.: ConicBundle 0.3.11. Fakultät für Mathematik, Technische Universität Chemnitz (2012).
  6. 6.
    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) CrossRefGoogle Scholar
  7. 7.
    Max Shen, Z.-J., Coullard, C., Daskin, M.S.: A joint location-inventory model. Transp. Sci. 37(1), 40–55 (2003)CrossRefGoogle Scholar
  8. 8.
    Stobbe, P., Krause, A.: Efficient minimization of decomposable submodular functions. CoRR, abs/1010.5511 (2010)Google Scholar

Copyright information

© Springer International Publishing Switzerland 2014

Authors and Affiliations

  • Frank Baumann
    • 1
  • Christoph Buchheim
    • 1
  • Anna Ilyina
    • 1
    Email author
  1. 1.Fakultät für MathematikTechnische Universität DortmundDortmundGermany

Personalised recommendations