Journal of Optimization Theory and Applications

, Volume 167, Issue 2, pp 585–616 | Cite as

Stability Analysis in Discrete Optimization Involving Generalized Addition Operations

  • Vyacheslav V. Chistyakov
  • Panos M. PardalosEmail author


This paper addresses the tolerance approach to the sensitivity analysis of optimal solutions to a nonlinear optimization problem of the form: minimize the total cost of a trajectory over all admissible discrete trajectories, where the total cost is expressed through individual costs by means of a generalized addition operation on the set of all non-negative or positive reals. We evaluate and present sharp estimates for upper and lower bounds of costs, for which an optimal solution to the above problem remains stable. These bounds present new results in the sensitivity analysis, as well as extend in a unified way most known results. We define an invariant of the optimization problem—the tolerance function, which is independent of optimal solutions, and establish its basic properties, among which are a characterization of the set of all optimal solutions, the uniqueness of an optimal solution, and extremal values of the tolerance function on an optimal solution.


Optimization problem Generalized addition Objective function Optimal solution Stability interval 

Mathematics Subject Classification

90C31 90C27 90C26 



The authors are partially supported by LATNA Laboratory, NRU HSE, RF government Grant 11.G34.31.0057.


  1. 1.
    Gusfield, D.: A note on arc tolerances in sparse shortest-path and network flow problems. Networks 13(2), 191–196 (1983)zbMATHMathSciNetCrossRefGoogle Scholar
  2. 2.
    Shier, D.R., Witzgall, C.: Arc tolerances in shortest path and network flow problems. Networks 10(4), 277–291 (1980)MathSciNetCrossRefGoogle Scholar
  3. 3.
    Tarjan, R.E.: Sensitivity analysis of minimum spanning trees and shortest path trees. Inf. Process. Lett. 14(1), 30–33 (1982)MathSciNetCrossRefGoogle Scholar
  4. 4.
    Libura, M.: Sensitivity analysis for minimum Hamiltonian path and traveling salesman problems. Discret. Appl. Math. 30(2–3), 197–211 (1991)zbMATHMathSciNetCrossRefGoogle Scholar
  5. 5.
    Sotskov, Yu.N., Leontev, V.K., Gordeev, E.N.: Some concepts of stability analysis in combinatorial optimization. Discret. Appl. Math. 58(2), 169–190 (1995)Google Scholar
  6. 6.
    Turkensteen, M., Ghosh, D., Goldengorin, B., Sierksma, G.: Tolerance-based branch and bound algorithms for the ATSP. Eur. J. Oper. Res. 189(3), 775–788 (2008)zbMATHMathSciNetCrossRefGoogle Scholar
  7. 7.
    Ravi, N., Wendell, R.E.: The tolerance approach to sensitivity analysis of matrix coefficients in linear programming. Manag. Sci. 35(9), 1106–1119 (1989)zbMATHMathSciNetCrossRefGoogle Scholar
  8. 8.
    Chakravarti, N., Wagelmans, A.P.M.: Calculation of stability radii for combinatorial optimization problems. Oper. Res. Lett. 23(1–2), 1–7 (1998)zbMATHMathSciNetCrossRefGoogle Scholar
  9. 9.
    Gál, T.: Postoptimal Analyses, Parametric Programming, and Related Topics. McGraw-Hill, New York (1979)zbMATHGoogle Scholar
  10. 10.
    Goldengorin, B.I., Jäger, G., Molitor, P.: Tolerances applied in combinatorial optimization. J. Comput. Sci. 2(9), 716–734 (2006)CrossRefGoogle Scholar
  11. 11.
    Gordeev, È.N., Leont’ev, V.K.: A general approach to the study of the stability of solutions in discrete optimization problems. Comput. Math. Math. Phys. 36(1), 53–58 (1996)zbMATHMathSciNetGoogle Scholar
  12. 12.
    Greenberg, H.J.: An annotated bibliography for post-solution analysis in mixed integer programming and combinatorial optimization. In: Woodruff, D.L. (ed.) Advances in Computational and Stochastic Optimization, Logic Programming, and Heuristic Search, pp. 97–147. Kluwer, Boston (1998)CrossRefGoogle Scholar
  13. 13.
    van Hoesel, C.P.M., Kolen, A.W.J., Rinnooy Kan, A.H.G., Wagelmans, A.P.M.: Sensitivity Analysis in Combinatorial Optimization: A Bibliography. Technical report 8944/A, Econometric Institute, Erasmus University, The Netherlands (1989)Google Scholar
  14. 14.
    Krasnosel’skiĭ, M.A., Rutickiĭ Ja, B.: Convex Functions and Orlicz Spaces. P. Noordhoff, Groningen (1961)Google Scholar
  15. 15.
    Krasnosel’skiĭ, M.A., Pokrovskiĭ, A.V.: Systems with Hysteresis. Springer, Berlin (1989)zbMATHCrossRefGoogle Scholar
  16. 16.
    Lawler, E.L.: Combinatorial Optimization: Networks and Matroids. Holt, Rinehart and Winston, New York (1976)zbMATHGoogle Scholar
  17. 17.
    Libura, M.: Optimality conditions and sensitivity analysis for combinatorial optimization problems. Control Cybern. 25(6), 1165–1180 (1996)zbMATHMathSciNetGoogle Scholar
  18. 18.
    Pardalos, P.M., Jha, S.: Complexity of uniqueness and local search in quadratic 0–1 programming. Oper. Res. Lett. 11(2), 119–123 (1992)zbMATHMathSciNetCrossRefGoogle Scholar
  19. 19.
    Chistyakov, V.V., Goldengorin, B.I., Pardalos, P.M.: Global tolerances in the problems of combinatorial optimization with an additive objective function. Dokl. Math. 86(2), 707–710 (2012)zbMATHMathSciNetCrossRefGoogle Scholar
  20. 20.
    Chistyakov, V.V., Goldengorin, B.I., Pardalos, P.M.: Extremal values of global tolerances in combinatorial optimization with an additive objective function. J. Glob. Optim. 53(3), 475–495 (2012)zbMATHMathSciNetCrossRefGoogle Scholar
  21. 21.
    Musielak, J., Peetre, J.: \(F\)-modular spaces. Funct. Approx. Comment. Math. 1, 67–73 (1974)zbMATHMathSciNetGoogle Scholar
  22. 22.
    Musielak, J.: Orlicz Spaces and Modular Spaces. Lecture Notes in Mathematics, vol. 1034. Springer, Berlin (1983)Google Scholar
  23. 23.
    Chistyakov, V.V.: Modular metric spaces generated by \(F\)-modulars. Folia Math. 15(1), 3–24 (2008)zbMATHMathSciNetGoogle Scholar

Copyright information

© Springer Science+Business Media New York 2015

Authors and Affiliations

  1. 1.Department of Applied Mathematics and Computer ScienceNational Research University Higher School of EconomicsNizhny NovgorodRussian Federation
  2. 2.Department of Industrial and Systems Engineering, Center for Applied OptimizationUniversity of FloridaGainesvilleUSA

Personalised recommendations