Advertisement

Cybernetics and Systems Analysis

, Volume 55, Issue 6, pp 949–957 | Cite as

On the Quasistability Radius for a Multicriteria Integer Linear Programming Problem of Finding Extremum Solutions

  • V. EmelichevEmail author
  • Yu. Nikulin
Article
  • 2 Downloads

Abstract

We consider a multicriteria integer linear programming problem with a targeting set of optimal solutions given by the set of all individual criterion minimizers (extrema). In this study, the lower and upper attainable bounds on the quasistability radius of the set of extremum solutions are obtained when solution and criterion spaces are endowed with different Hölder’s norms. As a corollary, an analytical formula for the quasistability radius is obtained for the case when the criterion space is endowed with Chebyshev’s norm. Some computational challenges are also discussed.

Keywords

integer linear programming multicriteria optimization extremum solution Pareto optimality stability analysis quasistability radius Hölder’s norm Chebyshev’s norm 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    J. Hadamard, Lectures on Cauchy’s Problem in Linear Partial Differential Equations, Yale University Press, New Haven (1923).zbMATHGoogle Scholar
  2. 2.
    I. Sergienko and V. Shilo, Discrete Optimization Problems: Challenges, Solution Techniques, Analysis [in Russian], Naukova Dumka, Kyiv (2003).Google Scholar
  3. 3.
    E. Belousov and V. Andronov, Solvability and Stability of Problems of Polynomial Programming [in Russian], Moscow University Publisher, Moscow (1993).zbMATHGoogle Scholar
  4. 4.
    I. Sergienko, L. Kozeratskaya, and T. Lebedeva, Stability and Parametric Analysis of Discrete Optimization Problems [in Russian], Naukova Dumka, Kyiv (1995).zbMATHGoogle Scholar
  5. 5.
    T. Lebedeva, N. Semenova, and T. Sergienko, “Stability of vector problems of integer optimization: Relationship with the stability of sets of optimal and nonoptimal solutions,” Cybernetics and Systems Analysis, Vol. 41, No. 4, 551–558 (2005).MathSciNetzbMATHCrossRefGoogle Scholar
  6. 6.
    T. Lebedeva and T. Sergienko, “Stability of a vector integer quadratic programming problem with respect to vector criterion and constraints,” Cybernetics and Systems Analysis, Vol. 42, No. 5, 667–674 (2006).MathSciNetzbMATHCrossRefGoogle Scholar
  7. 7.
    T. Lebedeva and T. Sergienko, “Different types of stability of vector integer optimization problem: General approach,” Cybernetics and Systems Analysis, Vol. 44, No. 3, 429–433 (2008).MathSciNetzbMATHCrossRefGoogle Scholar
  8. 8.
    T. Lebedeva, N. Semenova, and T. Sergienko, “Qualitative characteristics of the stability of vector discrete optimization problems with different optimality principles,” Cybernetics and Systems Analysis, Vol. 50, No. 2, 228–233 (2014).MathSciNetzbMATHCrossRefGoogle Scholar
  9. 9.
    T. Lebedeva, N. Semenova, and T. Sergienko, “Properties of perturbed cones ordering the set of feasible solutions of vector optimization problem,” Cybernetics and Systems Analysis, Vol. 50, No. 5, 712–717 (2014).MathSciNetzbMATHCrossRefGoogle Scholar
  10. 10.
    V. Emelichev, V. Kotov, K. Kuzmin, T. Lebedeva, N. Semenova, and T. Sergienko, “Stability and effective algorithms for solving multiobjective discrete optimization problems with incomplete information,” Journal of Automation and Information Sciences, Vol. 46, Iss. 2, 27–41 (2014).CrossRefGoogle Scholar
  11. 11.
    K. Kuzmin, Y. Nikulin, and M. Mäkelä, “On necessary and sufficient conditions of stability and quasistability in combinatorial multicriteria optimization,” Control and Cybernetics, Vol. 46, No. 4, 361–382 (2017).MathSciNetzbMATHGoogle Scholar
  12. 12.
    V. Leontev, “Discrete optimization,” Journal of Computational Physics and Mathematics, Vol. 47, Iss. 2, 328–340 (2007).Google Scholar
  13. 13.
    E. Gordeev, “Comparison of three approaches to studying stability of solutions to problems of discrete optimization and computational geometry,” Journal of Applied and Industrial Mathematics, Vol. 9, Iss. 3, 358–366 (2015).MathSciNetCrossRefGoogle Scholar
  14. 14.
    V. Emelichev and D. Podkopaev, “On a quantitative measure of stability for a vector problem in integer programming,” Journal of Computational Physics and Mathematics, Vol. 38, Iss. 11, 1727–1731 (1998).Google Scholar
  15. 15.
    V. Emelichev and D. Podkopaev, “Stability and regularization of vector problems of integer linear programming,” Diskretnyi Analiz i Issledovanie Operatsii, Ser. 2, Vol. 8, No. 1, 47–69 (2001).MathSciNetzbMATHGoogle Scholar
  16. 16.
    V. Emelichev, E. Girlich, Y. Nikulin, and D. Podkopaev, “Stability and regularization of vector problems of integer linear programming,” Optimization, Vol. 51, No. 4, 645–676 (2002).MathSciNetzbMATHCrossRefGoogle Scholar
  17. 17.
    V. Emelichev and D. Podkopaev, “Quantitative stability analysis for vector problems of 0-1 programming,” Discrete Optimization, Vol. 7, Iss. 1–2, 48–63 (2010).MathSciNetzbMATHCrossRefGoogle Scholar
  18. 18.
    V. Emelichev and K. Kuzmin, “Stability radius of a vector integer linear programming problem: Case of a regular norm in the space of criteria,” Cybernetics and Systems Analysis, Vol. 46, No. 1, 72–79 (2010).MathSciNetzbMATHCrossRefGoogle Scholar
  19. 19.
    V. Emelichev and V. Korotkov, “Stability radius of a vector investment problem with Savage’s minimax risk criteria,” Cybernetics and Systems Analysis, Vol. 48, No. 3, 378–386 (2012).MathSciNetzbMATHCrossRefGoogle Scholar
  20. 20.
    S. Bukhtoyarov and V. Emelichev, “On the stability measure of solutions to a vector version of an investment problem,” Journal of Applied and Industrial Mathematics, Vol. 9, Iss. 3, 328–334 (2015).MathSciNetzbMATHCrossRefGoogle Scholar
  21. 21.
    M. Libura and Y. Nikulin, “Stability and accuracy functions in multicriteria linear combinatorial optimization problem,” Annals of Operations Research, Vol. 147, Iss. 1, 255–267 (2006).MathSciNetzbMATHCrossRefGoogle Scholar
  22. 22.
    Y. Nikulin, “Stability and accuracy functions in a coalition game with bans, linear payoffs and antagonistic strategies,” Annals of Operations Research, Vol. 172, No. 1, 25–35 (2009).MathSciNetzbMATHCrossRefGoogle Scholar
  23. 23.
    Y. Sotskov, N. Sotskova, T. Lai, and F. Werner, Scheduling under Uncertainty, Theory and Algorithms [in Russian], Belaruskaya Nauka, Minsk (2010).Google Scholar
  24. 24.
    Y. Nikulin, “Accuracy and stability functions for a problem of minimization a linear form on a set of substitutions,” in: Y. Sotskov and F. Werner (eds.), Sequencing and Scheduling with Inaccurate Data, Ch. 15, Nova Science Publ. Inc. (2014), pp. 409–426.Google Scholar
  25. 25.
    V. Emelichev and A. Platonov, “Measure of quasistability of a vector integer linear programming with generalized principle of optimality in the Hölder metric,” Bulletin of the Academy of Sciences of Moldova. Mathematics, Vol. 57(2), 58–67 (2008).zbMATHGoogle Scholar
  26. 26.
    V. Emelichev and K. Kuzmin, “A general approach to studying the stability of a Pareto optimal solution of a vector integer linear programming problem,” Discrete Mathematics and Applications, Vol. 17, Iss. 4, 349–354 (2007).Google Scholar
  27. 27.
    V. Emelichev and K. Kuzmin, “On a type of stability of a multicriteria integer linear programming problem in the case of monotonic norm,” Journal of Computers and Systems Sciences International, Vol. 46, No. 5, 714–720 (2007).CrossRefGoogle Scholar
  28. 28.
    V. Podinovskii and V. Noghin, Pareto-Optimal Solutions of Multicriteria Problems, Fizmatlit, Moscow (2007).Google Scholar
  29. 29.
    L. Sholomov, Logical Methods for Investigation of the Discrete Choice Models [in Russian], Nauka, Moscow (1989).zbMATHGoogle Scholar
  30. 30.
    D. Yudin, Computational Methods in Decision Making [in Russian], Nauka, Moscow (1989).Google Scholar
  31. 31.
    M. Aizerman and F. Aleskerov, Choice of Alternatives: Theoretical Foundations, Nauka, Moscow (1990).zbMATHGoogle Scholar
  32. 32.
    A. Lotov and I. Pospelova, Multicriteria Decision Making Problems [in Russian], MAKS Press, Moscow (2008).Google Scholar
  33. 33.
    V. Pareto, Manuel D’ecoonomie Politique, V. Giard & E. BriЩre, Paris (1909).Google Scholar
  34. 34.
    M. Slater, “Lagrange multipliers revisited,” (Ccowles Commission Discussion, Paper: Mathematics 80, 1950), in: G. Giorgi and T. Kjeldsen (eds.), Traces and Emergence of Nonlinear Programming, Birkhäuser, Basel (2014), pp. 293–306.Google Scholar
  35. 35.
    R. E. Steuer, Multiple Criteria Optimization: Theory, Computation and Application, Wiley, New York (1986).zbMATHGoogle Scholar
  36. 36.
    K. Miettinen, Nonlinear Multiobjective Optimization, Kluwer, Boston (1999).zbMATHGoogle Scholar
  37. 37.
    V. Noghin, Reduction of the Pareto Set: An Axiomatic Approach (Studies in Systems, Decision and Control), Springer, Cham (2018).CrossRefGoogle Scholar
  38. 38.
    G. Hardy, J. Littlewood, and G. Polya, Inequalities, Cambridge University Press, Cambridge (1988).zbMATHGoogle Scholar
  39. 39.
    A. Tikhonov and V. Arsenin, Solutions of Ill-Posed Problems, Halsted Press, Washington-Winston-New York (1977).zbMATHGoogle Scholar
  40. 40.
    A. Kolmogorov and S. Fomin, Elements of the Theory of Functions and Functional Analysis [in Russian], Fizmatlit, Moscow (2009).Google Scholar
  41. 41.
    S. Smale, “Global analysis and economics V: Pareto theory with constraints,” Journal of Mathematical Economics, Vol. 1, Iss. 3, 213–221 (1974).MathSciNetzbMATHCrossRefGoogle Scholar
  42. 42.
    Y. Nikulin, O. Karelkina, M. M. Mäkelä, “On accuracy, robustness and tolerances in vector Boolean optimization,” European Journal of Operational Research, Vol. 224, Iss. 3, 449–457 (2013).MathSciNetzbMATHCrossRefGoogle Scholar
  43. 43.
    N. Chakravarti and A. Wagelmans, “Calculation of stability radius for combinatorial optimization problems,” Oper. Res. Lett., Vol. 23, Iss. 1–2, 1–7 (1998).MathSciNetzbMATHCrossRefGoogle Scholar
  44. 44.
    M. Ehrgott, Multicriteria Optimization, Springer, Berlin–Heidelberg (2005).zbMATHGoogle Scholar
  45. 45.
    K. Kuzmin, “A general approach to the calculation of stability radii for the max-cut problem with multiple criteria,” Journal of Applied and Industrial Mathematics, 9(4), 527–539 (2015).MathSciNetCrossRefGoogle Scholar
  46. 46.
    J. Roland, Y. Smet, and J. Figueira, “On the calculation of stability radius for multi-objective combinatorial optimization problems by inverse optimization,” 4OR-Q. J. Oper. Res., Vol. 10, Iss. 4, 379–389 (2012).MathSciNetzbMATHCrossRefGoogle Scholar

Copyright information

© Springer Science+Business Media, LLC, part of Springer Nature 2019

Authors and Affiliations

  1. 1.Belarusian State UniversityMinskBelarus
  2. 2.University of TurkuTurkuFinland

Personalised recommendations