Skip to main content
SpringerLink
Log in

Proving the convergence of the iterative method for solving a game-type combinatorial optimization problem on arrangements

  • Published:
Cybernetics and Systems Analysis Aims and scope

Abstract

We consider a game-type combinatorial optimization problem where constraints defined by arrangements are imposed on the strategies of one player and propose a theoretical justification for the iteration method of the solution to combinatorial optimization problems.

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, Ò. Ò. Lebedeva, and V. A. Roshchin, Approximate Methods to solve Discrete Optimization Problems [in Russian], Naukova Dumka, Kyiv (1980).

    Google Scholar 

  2. I. V. Sergienko and M. F. Kaspshitskaya, Models and Methods for Computer Solution of Combinatorial Optimization Problems [in Russian], Naukova Dumka, Kyiv (1981).

    Google Scholar 

  3. I. V. Sergienko, Mathematical Models and Methods to Solve Discrete Optimization Problems [in Russian], Naukova Dumka, Kyiv (1988).

    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, Informatics in Ukraine: Formation, Development, and Problems [in Ukrainian], Naukova Dumka, Kyiv (1999).

    Google Scholar 

  6. I. V. Sergienko and V. P. Shilo, Discrete Optimization Problems: Challenges, Methods, Solutions, Analysis [in Russian], Naukova Dumka, Kyiv (2003).

    Google Scholar 

  7. O. A. Iemets, Euclidean Combinatorial Sets and Optimization on them. Advances in Mathematical Programming [in Russian], UMK VO, Kyiv (1992).

    Google Scholar 

  8. Yu. G. Stoyan and O. O. Iemets, Theory and Methods of Euclidean Combinatorial Optimization [in Ukrainian], Inst. Syst. Doslidzh. Osvity, Kyiv (1993).

    Google Scholar 

  9. O. O. Iemets, L. M. Kolechkina, and S. I. Nedobachii, Analysis of the Domains of Definition of Euclidean Combinatorial Problems of Arrangements [in Ukrainian], ChPKP Legat, Poltava (1999).

    Google Scholar 

  10. Yu. G. Stoyan, O. O. Iemets, and Ye. M. Yemets, Optimization of Polyarrangements: Theory and Methods [in Ukrainian], PUSKU, Poltava (2005).

    Google Scholar 

  11. O. A. Iemets and L. N. Kolechkina, Combinatorial Optimization Problems with Linear Fractional Objective Functions [in Russian], Naukova Dumka, Kyiv (2005).

    Google Scholar 

  12. O. O. Iemets and O. V. Roskladka, Optimization Problems on Polycombinatorial Sets: Properties and Solution [in Ukrainian], PUSKU, Poltava (2006).

    Google Scholar 

  13. O. A. Iemets and T. N. Barbolina, Combinatorial Optimization on Arrangements [in Russian], Naukova Dumka, Kyiv (2008).

    Google Scholar 

  14. O. A. Iemets and N. G. Romanova, Optimization on Polypermutations [in Russian], Naukova Dumka, Kyiv (2010).

    Google Scholar 

  15. O. O. Iemets and N. Yu. Ust’yan, “Solving game problem on permutations,” Naukovi Visti NTUU KPI, No. 3, 47–52 (2007).

  16. O. A. Yemets and N. Yu. Ust’yan, “Analysis of mathematical models and methods of solving combinatorial optimization problems on game-type permutations,” Cybern. Syst. Analysis, 43, No. 6, 848–857 (2007).

    Article  MATH  Google Scholar 

  17. O. A. Emets and N. Yu. Ustian, “Solving of some problems of combinatorial optimization on arrangements and permutations of game type,” J. Automat. Inform. Sci., 38, Issue 5, 34–45 (2006).

    Article  Google Scholar 

  18. O. A. Emets and N. Yu. Ustian, “Studies of problems of combinatorial optimization of game type on arrangements,” J. Automat. Inform. Sci., 39, Issue 1, 24–35 (2007).

    Article  Google Scholar 

  19. O. O. Iemets and N. Yu. Ust’yan, “An iterative method to solve game problems on permutations,” Naukovi Visti NTUU KPI, No. 3, 5–10 (2008).

  20. O. A. Yemets and N. Yu. Ustian, “Games with combinatorial constraints,” Cybern. Syst. Analysis, 44, No. 4, 575–581 (2008).

    Article  MATH  Google Scholar 

  21. E. V. Olkhovskaja and O. A. Yemets, “Iterative method for solving combinatorial optimization problems of the game type on arrangements,” J. Automat. Inform. Sci., 43, Issue 5, 52–63 (2011).

    Article  Google Scholar 

  22. Yu. M. Ermoliev, I. I. Lyashko, V. S. Mikhalevich, and V. I. Tyuptya, Mathematical Methods of Operations Research: A Manual for High Schools [in Russian], Vyshcha Shkola, 1979.

  23. E. S. Ventsel’, Elements of Game Theory [in Russian], Fizmatgiz, Moscow (1961).

    Google Scholar 

  24. J. Robinson, “An iterative method of solving a game,” The Annals of Mathematics, Second Series, 54, No. 2, 296–301 (1951).

    Article  MATH  Google Scholar 

  25. O. A. Emets and A. A. Roskladka, “On estimates of minima of criterion functions in optimization on combinations,” Ukrainian Math. J., 51, No. 8, 1262–1265 (1999).

    Article  MathSciNet  Google Scholar 

  26. V. A. Il’in, V. A. Sadovnichii, and Bl. H. Sendov, “Mathematical analysis,” in: Theory of Limits, Vol. 1, Ch. 3 [in Russian], Prospekt, Moscow (2006), pp. 92–105.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Poltava University of Economics and Trade, Poltava, Ukraine

    O. A. Iemetsa & E. V. Olkhovskaja

Authors
  1. O. A. Iemetsa
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. E. V. Olkhovskaja
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to O. A. Iemetsa.

Additional information

Translated from Kibernetika i Sistemnyi Analiz, No. 1, January–February, 2013, pp. 102–114.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Iemetsa, O.A., Olkhovskaja, E.V. Proving the convergence of the iterative method for solving a game-type combinatorial optimization problem on arrangements. Cybern Syst Anal 49, 86–97 (2013). https://doi.org/10.1007/s10559-013-9489-0

Download citation

  • Received:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10559-013-9489-0

Keywords

Search

Navigation