Skip to main content
SpringerLink
Log in

Stability of discrete optimization problems

  • Systems Analysis
  • Published:
Cybernetics and Systems Analysis Aims and scope

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

References

  1. A. V. Fiacco and W. P. Hutzler, “Basic results in the development of sensitivity and stability analysis in nonlinear programming,”Comput. Oper. Res.,9, No. 3, 9–28 (1982).

    Google Scholar 

  2. A. N. Tikhonov and V. Ya. Arsenin,Methods of Solution of Ill-Posed Problems [in Russian], Nauka, Moscow (1974).

    Google Scholar 

  3. V. M. Glushkov, “System optimization,”Kibernetika, No. 5, 3–5 (1980).

    Google Scholar 

  4. I. I. Eremin, V. D. Mazurov, and N. N. Astaf'ev,Improper Linear and Convex Programming Problems [in Russian], Nauka, Moscow (1983).

    Google Scholar 

  5. ”Sensitivity, stability, and parametric analysis,”Math. Progr. Study,21, Nos. 1–6, 1–242 (1984).

  6. B. Bank, J. Guddat, and J. Klatte,Non-Linear Parametric Optimization, Akad. Verlag, Berlin (1982).

    Google Scholar 

  7. E. G. Belousov and B. Bank (eds.),Mathematical Optimization: Solvability and Stability [in Russian], Moscow University Press, Moscow (1986).

    Google Scholar 

  8. S. A. Ashmanov,Linear Programming [in Russian], Nauka, Moscow (1981).

    Google Scholar 

  9. V. K. Leont'ev, “Stability in linear discrete problems,”Probl. Kiber., No. 35, 169–184 (1979).

    Google Scholar 

  10. N. N. Astaf'ev,Linear Inequalities and Convexity [in Russian], Nauka, Moscow (1982).

    Google Scholar 

  11. N. N. Astaf'ev, “Stability and marginal values in convex programming problem,”Sib. Mat. Zh.,19, No. 3, 92–98 (1978).

    Google Scholar 

  12. V. V. Fedorov,Numerical Maxmin Methods [in Russian], Nauka, Moscow (1979).

    Google Scholar 

  13. V. Bohm, “On the continuity of the optimal policy set for linear programming,”SIAM J. Appl. Math.,28, 303–306 (1975).

    Google Scholar 

  14. B. Brosowsky, “On parametric linear optimization,”Lect. Notes Econ. Math. Syst.,157, 37–44 (1978).

    Google Scholar 

  15. B. Dantzig, J. Folkman, and N. Shapiro, “On the continuity of the minimum set of a continuous function,”J. Math. Anal. Appl.,17, 519–548 (1967).

    Google Scholar 

  16. D. H. Martin, “On the continuity of the maximum in parametric linear programming,”J. Opt. Theor. Appl.,17, 205–210 (1975).

    Google Scholar 

  17. S. M. Robinson, “A characterization of stability in linear programming,”Oper. Res.,25, No. 3, 412–437 (1977).

    Google Scholar 

  18. J. Rohn, “On sensitivity of the optimal value of a linear program,”Econ. Math. Obs.,25, No. 1, 105–107 (1989).

    Google Scholar 

  19. R. M. Freund, “Postoptimal analysis of a linear program under simultaneous changes in matrix coefficients,”Math. Progr.,24, 1–13 (1985).

    Google Scholar 

  20. S. M. Shvartin, “General stability problem for some classes of linear programming problems,”Dokl. Akad. Nauk SSSR,25, No. 1, 56–59 (1985).

    Google Scholar 

  21. E. G. Gol'shtein,Duality Theory in Mathematical Programming and Its Applications [in Russian], Nauka, Moscow (1971).

    Google Scholar 

  22. J. P. Evans and F. J. Gould, “Stability in nonlinear programming,”Oper. Res.,18, No. 1, 107–118 (1970).

    Google Scholar 

  23. C. Kuratowski,Topology [Russian translation], Mir, Moscow (1966).

    Google Scholar 

  24. I. V. Sergienko,Mathematical Models and Methods for Solving Discrete Optimization Problems [in Russian], Naukova Dumka, Kiev (1988).

    Google Scholar 

  25. L. N. Kozeratskaya, T. T. Lebedeva, and I. V. Sergienko, “Stability and parametric and postoptimal analysis of discrete optimization problems,”Kibernetika, No. 3, 73–80 (1983).

    Google Scholar 

  26. V. K. Leont'ev and K. Kh. Mamutov, “Stability of solutions in linear Boolean programming problems,”Zh. Vychisl. Mat. Mat. Fiz.,28, No. 10, 14–75 (1989).

    Google Scholar 

  27. B. Bank, “Stability analysis in pure and mixed integer linear programming,”Lect. Notes Contr. Inf. Sci.,23, 148–153 (1980).

    Google Scholar 

  28. B. Bank and R. Mandel, “Quantitative stability of (mixed) integer linear optimization,”Lect. Notes Econ. Math. Syst.,304, 3–15 (1988).

    Google Scholar 

  29. L. N. Kozeratskaya, “Stability regions of one integer programming problem,”Dokl. Akad. Nauk UkrSSR, Ser. A, No. 2, 57–60 (1986).

    Google Scholar 

  30. C. E. Blair and R. G. Jeroslow, “Computational complexity of some problems in parametric discrete programming. I,”Math. Oper. Res.,11, 241–260 (1986).

    Google Scholar 

  31. C. E. Blair and R. G. Jeroslow, “The value function of an integer program. II,”Discret. Math.,25, No. 1, 28–47 (1979).

    Google Scholar 

  32. C. E. Blair and R. G. Jeroslow, “An exact penalty method for mixed integer program,”Math. Oper. Res.,6, No. 1, 128–134 (1981).

    Google Scholar 

  33. C. E. Blair and R. G. Jeroslow, “The value function of an integer program,”Math. Progr.,23, No. 3, 237–273 (1982).

    Google Scholar 

  34. A. M. Geoffrion and R. Nauss, “Parametric and postoptimality analysis in integer linear programming,”Manag. Sci.,24, No. 5, 453–466 (1977).

    Google Scholar 

  35. L. Lupsa, “Sur quelques problemes de programmation parametrique en nombres entiers,”Proc. 3rd Colloq. Oper. Res., Cluj-Napoca (1978), pp. 156–158.

  36. P. Feautrier, “Parametric integer programming,”RAIRO Oper. Res.,22, No. 3, 243–268 (1988).

    Google Scholar 

  37. G. R. Wilson and H. K. Jain, “An approach to postoptimality analysis of zero-one goal programs,”Nav. Res. Logist. Quart.,35, 73–84 (1988).

    Google Scholar 

  38. D. A. Boyarchuk, “Algorithm to solve the parametric integer programming problem,” in:Discrete Optimization Methods and Efficient Implementation of Program Packages [in Russian], IK AN UkrSSR, Kiev (1985), pp. 56–59.

    Google Scholar 

  39. C. Dinescu and B. Savulescu, “Sensitive and parametric analysis of maximum flow in networks,”Math. Oper. Stat., Ser. Optimization,15, No. 2, 263–273 (1984).

    Google Scholar 

  40. H. W. Hamakher and L. R. Foulds, “Algorithms for flows with parametric capacities,”Z. Oper. Res.,33, No. 1, 21–37 (1989).

    Google Scholar 

  41. S. E. Elmaghraby, “Sensitivity analysis of multiterminal flow networks,”Oper. Res.,12, 680–688 (1964).

    Google Scholar 

  42. P. J. Carstensen, “Complexity of some parametric integer and network programming problems,”Math. Progr.,26, No. 1, 64–75 (1983).

    Google Scholar 

  43. G. Ruhe, “Parametric maximal flows in generalized networks: complexity and algorithms,”Optimization,19, No. 2, 235–251 (1988).

    Google Scholar 

  44. G. Gallo, M. D. Grigoriadis, and R. J. Tarjan, “A fast parametric maximum flow algorithm and application,”SIAM J. Comput.,18, No. 1, 30–55 (1989).

    Google Scholar 

  45. V. K. Leont'ev, “Stability of the traveling salesman problem,”Zh. Vychisl. Mat. Mat. Fiz.,15, No. 5, 1293–1309 (1975).

    Google Scholar 

  46. V. K. Leont'ev,Stability of Solutions in Linear Extremal Problems [in Russian], Thesis, VTs AN SSSR, Moscow (1981).

    Google Scholar 

  47. É. N. Gordeev and V. K. Leont'ev, “Stability in bottleneck problems,”Zh. Vychisl. Mat. Mat. Fiz.,20, No. 4, 1071–1075 (1980).

    Google Scholar 

  48. É. N. Gordeev and V. K. Leont'ev, “Path parametric problems,”Zh. Vychisl. Mat. Mat. Fiz.,12, No. 1, 37–46 (1984).

    Google Scholar 

  49. É. N. Gordeev,Algorithmic and Postoptimal Stability Analysis of Solutions of Discrete Optimization Problems [in Russian], Thesis, VTs AN SSSR, Moscow (1992).

    Google Scholar 

  50. I. V. Sergienko and M. F. Kaspshitskaya, “Stability of a discrete location problem,”Dokl. Akad. Nauk UkrSSR, Ser. A, No. 11, 72–76 (1984).

    Google Scholar 

  51. M. F. Kaspshitskaya, “Stability of solution in the traveling salesman problem,”Kibernetika, No. 3, 121–122 (1986).

    Google Scholar 

  52. M. F. Kaspshitskaya, “Stability of solution of one combinatorial optimization problem,”Dokl. Akad. Nauk UkrSSR, Ser. A, No. 10, 60–64 (1985).

    Google Scholar 

  53. M. F. Kaspshitskaya and V. V. Glushkova, “Stability of solution of the traveling salesman problem with moving objects,”Kibernetika, No. 3, 42–44 (1986).

    Google Scholar 

  54. R. J. Tarjan, “Sensitivity analysis of minimum spanning trees and shortest path trees,”Inf. Proc. Lett.,14, No. 1, 30–33 (1982).

    Google Scholar 

  55. G. M. Weber, “Sensitivity analysis of optimal matching,”Networks,11, No. 1, 41–56 (1981).

    Google Scholar 

  56. E. Skubalska-Rafailowicz, “Sensitivity analysis of optimal solutions in scheduling problems,”Zesz. Nauk. Politech. Slask., 970 Autom. 94 (1988), pp. 277–285.

  57. Yu. N. Sotskov, “Stability of time-optimal schedules,”Zh. Vychisl. Mat. Mat. Fiz.,29, No. 5, 723–731 (1989).

    Google Scholar 

  58. R. Dombrowskij, “Zadanija transportowe z parametryeznymi ograniczeniami,”Przegl. Statyst.,15, No. 1, 103–117 (1968).

    Google Scholar 

  59. J. Intrator and J. Paroush, “Sensitivity analysis of the classical transportation problem,”Comput. Oper. Res.,4, No. 3, 213–226 (1977).

    Google Scholar 

  60. V. V. Podinovskii and V. D. Nogin,Pareto-Optimal Solutions of Multicriterion Problems [in Russian], Nauka, Moscow (1982).

    Google Scholar 

  61. D. A. Molodtsov,Stability of Optimality Principles [in Russian], Nauka, Moscow (1987).

    Google Scholar 

  62. M. G. Klepikova, “Stability of the linear multicriterion optimization problem,”Zh. Vychisl. Mat. Mat. Fiz.,27, No. 2, 178–188 (1987).

    Google Scholar 

  63. P. Iacob, “The solution of the Pareto optimization problem in decision space and in the objective space; stability properties,”Proc. Colloq. Approximation and Optimization, Cluj-Napoca (1984), pp. 254–259.

  64. L. N. Kozeratskaya, T. T. Lebedeva, and T. I. Sergienko, “Integer programming problems with vector criterion: parametric and stability analysis,”Dokl. Akad. Nauk SSSR,307, No. 3, 527–529 (1989).

    Google Scholar 

  65. T. I. Sergienko, “Constraint-stability of multicriterion integer programming problem,”Dokl. Akad. Nauk UkrSSR, Ser. A, No. 3, 79–81 (1989).

    Google Scholar 

  66. L. N. Kozeratskaya, T. T. Lebedeva, and T. I. Sergienko, “Mixed integer vector optimization: stability issues,”Kibernetika, No. 1, 58–61 (1991).

    Google Scholar 

  67. L. N. Kozeratskaya, T. T. Lebedeva, and T. I. Sergienko, “Parametric and stability analysis of multicriterion integer linear programming problems,”Kibernetika, No. 3, 41–44, 68 (1988).

    Google Scholar 

  68. L. N. Kozeratskaya, T. T. Lebedeva, and T. I. Sergienko, “Regularization of integer vector optimization problems,”Kibernetika, No. 3, 93 (1993).

    Google Scholar 

  69. T. Tanino, “Sensitivity analysis in multiobjective optimization,”J. Optim. Theory Appl.,56, No. 3, 479–499 (1988).

    Google Scholar 

  70. V. V. Gorokhovik and N. N. Rachkovskii, “Stability of vector optimization problems,”Vestsi Akad. Nauk BSSR, Ser. Fiz.-Mat. Nauk, No. 2, 3–8 (1990).

    Google Scholar 

  71. A. V. Bakurova and V. A. Perepelitsa,Stability and Complexity Analysis of Vector Problems in Graphs [in Russian], Zaporozh. Gos. Univ., Zaporozh'e (1992).

    Google Scholar 

  72. V. A. Perepelitsa,Development and Analysis of Algorithms of Sets of Alternatives for One Class of Discrete Problems [in Russian], Thesis, Zaporozh. Gos. Univ., Zaporozh'e (1988).

    Google Scholar 

Download references

Authors
  1. L. N. Kozeratskaya
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. T. T. Lebedeva
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. I. V. Sergienko
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

The study was financed by the State Fund for Basic Research of the State Committee of the Science of Technology of Ukraine.

Translated from Kibernetika i Sistemnyi Analiz, No. 3, pp. 78–93, May–June, 1993.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Kozeratskaya, L.N., Lebedeva, T.T. & Sergienko, I.V. Stability of discrete optimization problems. Cybern Syst Anal 29, 367–378 (1993). https://doi.org/10.1007/BF01125542

Download citation

  • Received:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF01125542

Keywords

Search

Navigation