Cybernetics and Systems Analysis

, Volume 51, Issue 5, pp 714–719 | Cite as

On the Complexity of Calculating Sensitivity Parameters in Boolean Programming Problems



This article shows that, for NP-hard problems, the calculation of even the stability ball of radius 1 for an optimal solution is computationally intensive (i.e., a suitable polynomial algorithm is absent when P ≠ NP). In using greedy algorithms for solving the set covering problem (knapsack problem) with the stability radius r = O(1) , there are polynomial algorithms for calculating the stability ball of radius r for an ln m-approximate solution (1-approximate solution).


complexity of sensitivity analysis stability radius of a problem stability ball of radius r for an ε-approximate problem solution 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    D. Fernandez-Baca and B. Venkatachalam, “Sensitivity analysis in combinatorial optimization,” in: T. Gonzalez (ed.), Handbook of Approximation Algorithms and Metaheuristics, Chapman&Hall/CRC Computer and Information Science Series, Boca Raton (2007), pp. 30.-1–30.-29.Google Scholar
  2. 2.
    V. K. Leontiev and K. Kh. Mamutov, “Stability of solutions in problems of Boolean linear programming,” Computational Mathematics and Mathematical Physics, 28, No. 10, 1475–1481 (1988)MathSciNetGoogle Scholar
  3. 3.
    Yu. N. Sotskov, “Stability analysis of an approximate solution of a Boolean problem of minimization of a linear form,” Computational Mathematics and Mathematical Physics, 33, No. 5, 785–795 (1993)MATHMathSciNetGoogle Scholar
  4. 4.
    N. Chakravarti and A. P. M. Wagelmans, “Calculation of stability radii for combinatorial optimization problems,” Operations Research Letters, 23, 1–7 (1998).MATHMathSciNetCrossRefGoogle Scholar
  5. 5.
    I. V. Sergienko, Mathematical Models and Methods for Solving Discrete Optimization Problems [in Russian], Naukova Dumka, Kyiv (1985).Google Scholar
  6. 6.
    I. V. Sergienko and N. V. Filonenko, “Solution of some stability problems in integer linear programming,” Dop. AN URSR, Ser. A, No. 6, 79–82 (1982).Google Scholar
  7. 7.
    S. Van Hoesel and A. Wagelmans, “On the complexity of postoptimality analysis of 0/1 programs,” Discrete Applied Mathematics, 91, 251–263 (1999).MATHMathSciNetCrossRefGoogle Scholar
  8. 8.
    C. Blair, “Sensitivity analysis for knapsack problems: A negative result,” Discrete Applied Mathematics, 81, 133–139 (1998).MATHMathSciNetCrossRefGoogle Scholar
  9. 9.
    G. J. Woeginger, “Sensitivity analysis for knapsack problems: Another negative result,” Discrete Applied Mathematics, 92, 247–251 (1999).MATHMathSciNetCrossRefGoogle Scholar
  10. 10.
    V. A. Mikhailyuk, “General approach to estimating the complexity of postoptimality analysis for discrete optimization problems,” Cybernetics and Systems Analysis, 46, No. 2, 290–295 (2010)MATHMathSciNetCrossRefGoogle Scholar
  11. 11.
    V. A. Mikhailyuk and N. V. Lishchuk, “Sensitivity analysis of the knapsack problem: A negative result,” Cybernetics and Systems Analysis, 49, No. 2, 201–204 (2013)MATHMathSciNetCrossRefGoogle Scholar
  12. 12.
    V. A. Mikhailyuk, “Reoptimization of max k-cover: Approximation ratio threshold,” Cybernetics and Systems Analysis, 48, No. 2, 242–248 (2012)MATHMathSciNetCrossRefGoogle Scholar
  13. 13.
    V. A. Chvatal, “A greedy heuristic for the set covering problem,” Mathematics of Operation Research, 4, No. 3, 233–235 (1979)MATHMathSciNetCrossRefGoogle Scholar
  14. 14.
    N. N. Kuzyurin and S. A. Fomin, Efficient Algorithms and Complexity of Computations [in Russian], Moscow Institute of Physics and Technology, Moscow (2008).Google Scholar

Copyright information

© Springer Science+Business Media New York 2015

Authors and Affiliations

  1. 1.Lesya Ukrainka Eastern European National UniversityLutskUkraine

Personalised recommendations