Skip to main content
SpringerLink
Log in

Stability criterion for a lexicographic Boolean optimization problem

  • Published:
Cybernetics and Systems Analysis Aims and scope

Abstract

A vector Boolean sequential minimization problem for absolute values of linear functions is considered. Necessary and sufficient condition for stability of this type that is a discrete analogue of the upper Hausdorff semicontinuity of a point-to-set mapping is established. This mapping associates a set of lexicographic optima with each set of problem parameters.

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. I. V. Sergienko, L. N. Kozeratskaya, and T. T. Lebedeva, Stability and Parametric Analyse of Discrete Optimization Problems [in Russian], Naukova Dumka, Kyiv (1995).

    Google Scholar 

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

    Google Scholar 

  3. V. A. Emelichev and D. P. Podkopaev, “Stability and regularization of vector problems of integer linear programming,” Diskret. Analiz Issled. Oper., Ser. 2, 8, No. 1, 47–69 (2001).

    MATH  MathSciNet  Google Scholar 

  4. Yu. N. Sotskov and N. Yu. Sotskova, The Scheduling Theory. Systems with Uncertain Numerical Parameters [in Russian], HAH Byelarusi, Minsk (2004).

    Google Scholar 

  5. H. J. Greenberg, “An annotated bibliography for post-solution analysis in mixed integer programming and combinatorial optimization,” in: Advances in Computational and Stochastic Optimization, Logic Programming and Heuristic Search, Kluwer Academ. Publ., Boston, MA (1998), pp. 97–148.

    Google Scholar 

  6. V. A. Emelichev and R. A. Berdysheva, “Stability conditions for the vector path problem in lexicographic discrete optimization,” Cybern. Syst. Analysis, 34, No. 4, 596–602 (1998).

    Article  MATH  MathSciNet  Google Scholar 

  7. V. A. Emelichev and O. A. Yanushkevich, “Regularization of a lexicographic vector problem of integer programming,” Cybern. Syst. Analysis, 35, No. 6, 951–955 (1999).

    MATH  MathSciNet  Google Scholar 

  8. V. A. Emelichev and O. A. Yanushkevich, “Stability and regularization of the lexicographic vector problem of quadratic discrete programming,” Cybern. Syst. Analysis, 36, No. 2, 196–202 (2000).

    Article  MATH  MathSciNet  Google Scholar 

  9. V. A. Emelichev and Yu. V. Nikulin, “On stability and quasi-stability of a vector lexicographic quadratic Boolean programming problem,” Revue d’Analyse Numerique et de Theorie de l’Approximation, Romania, 30, No. 1, 35–46 (2001).

    MATH  MathSciNet  Google Scholar 

  10. 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 

  11. V. A. Emelichev and K. G. Kuz’min, “A discrete analog of Hausdorff semicontinuity of the optimal mapping in a lexicographic Boolean problem,” Vestn. Byelorus. Univ., Ser. 1, No. 2, 105–108 (2005).

  12. I. V. Sergienko, Mathematical Models and Methods of Solving Discrete Optimization Problems [in Russian], Naukova Dumka, Kyiv (1988).

    Google Scholar 

  13. Yu. Yu. Chervak, Optimization. Unimprovable Choice [in Ukrainian], Uzhgorod. Nats. Univ., Uzhgorod (2002).

    Google Scholar 

  14. T. T. 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 

  15. T. T. 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 

  16. T. T. Lebedeva and T. I. Sergienko, “Stability of a vector integer quadratic programming problem with respect to vector criterion and constraints,” Cybern. Syst. Analysis, 42, No. 5, 667–674 (2006).

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Belarusian State University, Minsk, Belarus

    E. E. Gurevskii, V. A. Emelichev & K. G. Kuz’min

Authors
  1. E. E. Gurevskii
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. V. A. Emelichev
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. K. G. Kuz’min
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

The study was sponsored by the Fundamental and Applied Research Interuniversity Program of the Republic of Belarus (Grant 492/28).

__________

Translated from Kibernetika i Sistemnyi Analiz, No. 4, pp. 127–132, July–August 2007.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Gurevskii, E.E., Emelichev, V.A. & Kuz’min, K.G. Stability criterion for a lexicographic Boolean optimization problem. Cybern Syst Anal 43, 571–575 (2007). https://doi.org/10.1007/s10559-007-0082-2

Download citation

  • Received:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10559-007-0082-2

Keywords

Search

Navigation