Skip to main content
SpringerLink
Log in

Stability radius of a vector integer linear programming problem: case of a regular norm in the space of criteria

  • Published:
Cybernetics and Systems Analysis Aims and scope

A multicriteria integer linear programming problem of finding a Pareto set is considered. The set of feasible solutions is supposed to be finite. The lower and upper achievable bounds for the radius of stability are obtained using a stability criterion and the Minkowski–Mahler inequality and assuming that the norm is arbitrary in the space of solutions and is monotone in the space of criteria. Bounds for the radius of stability in spaces with the Holder metric are given in corollaries.

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

Similar content being viewed by others

References

  1. L. N. Kozeratskaya, Ò. Ò. Lebedeva, and T. I. Sergienko, “Questions of parameter analysis and stability investigation of multicriteria problems of integer linear programming,” Cybernetics, 24, No. 3, 320–323 (1988).

    Article  MATH  MathSciNet  Google Scholar 

  2. L. N. Kozeratskaya, Ò. Ò. Lebedeva, and T. I. Sergienko, “Necessary and sufficient conditions for multicriteria integer programming problems,” Dokl. AN USSR, Ser. À, No. 10, 76–78 (1988).

  3. L. N. Kozeratskaya, Ò. Ò. Lebedeva, and T. I. Sergienko, “Integer programming problems with vector criteria: parametric and stability analyses,” Dokl. AN SSSR, 307, No. 3, 527–529 (1989).

    Google Scholar 

  4. I. V. Sergienko, L. N. Kozeratskaya, and T. T. Lebedeva, Stability and Parametric Analyses of Discrete Optimization Problems [in Russian], Naukova Dumka, Kyiv (1995).

    Google Scholar 

  5. I. V. Sergienko and V. P. Shilo, Discrete Optimization Problems. Challenges, Solution Techniques, and Analysis [in Russian], Naukova Dumka, Kyiv (2003).

    Google Scholar 

  6. Ò. Ò. Lebedeva and T. I. Sergienko, “Comparative analysis of different types of stability with respect to constraints of a vector integer-optimization problem,” Cybern. Syst. Analysis, 40, No. 1, 52–57 (2004).

    Article  MATH  MathSciNet  Google Scholar 

  7. Ò. Ò. Lebedeva, N. V. Semenova, and T. I. Sergienko, “Stability of vector problems of integer optimization: Relationship with the stability of sets of optimal and nonoptimal solutions,” Cybern. Syst. Analysis, 41, No. 4, 551–558 (2005).

    Article  MATH  MathSciNet  Google Scholar 

  8. Ò. Ò. Lebedeva and T. I. Sergienko, “Different types of stability of vector integer optimization problem: General approach,” Cybern. Syst. Analysis, 44, No. 3, 429–433 (2008).

    Article  MATH  MathSciNet  Google Scholar 

  9. V. A. Emelichev and D. P. Podkopaev, “A quantitative measure of stability of a vector integer programming problem,” Zh. Vych. Mat. Mat. Fiz., 38, No. 11, 1801–1805 (1998).

    MathSciNet  Google Scholar 

  10. V. A. Emelichev and K. G. Kuzmin, “On a type of stability of a multicriterion integer linear programming problem in the case of monotonic norm,” Izv. RAN, Teoriya i Sistemy Upravl., No. 5, 45–51 (2007).

  11. V. A. Emelichev and K. G. Kuzmin, “General approach to the stability analysis of a Pareto-optimal solution of a vector integer linear programming problem,” Diskretn. Matem., 19, Issue 3, 79–83 (2007).

    MathSciNet  Google Scholar 

  12. E. F. Beckenbach and R. Bellman, Inequalities, Random House, New York (1961).

    Google Scholar 

  13. Tosio Kato, Perturbation Theory for Linear Operators, Springer-Verlag, New York (1966).

    MATH  Google Scholar 

  14. V. K. Leont’ev, “Stability in linear discrete problems,” Problemy Kibernetiki, Issue 35, 169–184 (1979).

  15. V. K. Leont’ev and E. N. Gordeev, “Qualitative investigation of path problems,” Cybernetics, 22, No. 5, 636–646 (1986).

    Article  MATH  MathSciNet  Google Scholar 

  16. E. N. Gordeev and V. K. Leontiev, “General approach to the stability analysis of solutions in discrete optimization problems,” Zh. Vych. Mat. Mat. Fiz., 36, No. 1, 66–72 (1996).

    Google Scholar 

  17. V. A. Emelichev, E. Girlich, Yu. V. Nikulin, and D. P. Podkopaev, “Stability and regularization of vector problems of integer linear programming,” Optimization, 51, No. 4, 645–676 (2002).

    Article  MATH  MathSciNet  Google Scholar 

  18. A. N. Kolmogorov and S. V. Fomin, Elements of the Theory of Functions and Functional Analysis [in Russian], Fizmatlit, Moscow (2004).

    Google Scholar 

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

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Belarusian State University, Minsk, Belarus

    V. A. Emelichev & K. G. Kuzmin

Authors
  1. V. A. Emelichev
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. K. G. Kuzmin
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to V. A. Emelichev.

Additional information

Translated from Kibernetika i Sistemnyi Analiz, No. 1, pp. 82–89, January–February 2010.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Emelichev, V.A., Kuzmin, K.G. Stability radius of a vector integer linear programming problem: case of a regular norm in the space of criteria. Cybern Syst Anal 46, 72–79 (2010). https://doi.org/10.1007/s10559-010-9185-2

Download citation

  • Received:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10559-010-9185-2

Keywords

Search

Navigation