SpringerLink
Log in

Properties of the Linear Unconditional Problem of Combinatorial Optimization on Arrangements Under Probabilistic Uncertainty

  • Published:
Cybernetics and Systems Analysis Aims and scope

Abstract

The paper establishes the necessary condition for the solution of a linear unconditional problem of combinatorial optimization on arrangements where coefficients of objective function are positive. These results are used to establish the properties of the solution of linear unconditional optimization problem on arrangements for the case where probabilistic uncertainty takes place in the definition of the feasible domain and the minimum is defined according to the linear order introduced on the set of discrete random variables: we formulate and prove the condition that can underlie the search for solution and the ways of constructing the solution in some special cases.

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

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
EUR 32.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or Ebook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price includes VAT (Germany)

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Yu. G. Stoyan and O. O. Iemets, Theory and Methods of Euclidean Combinatorial Optimization [in Ukrainian], Inst. Syst. Doslidzh. Osvity, Kyiv (1993). http://dspace.puet.edu.ua/handle/123456789/487.

    Google Scholar 

  2. O. O. Iemets and T. M. Barbolina, Combinatorial Optimization on Arrangements [in Ukrainian], Naukova Dumka, Kyiv (2008). http://dspace.puet.edu.ua/handle/123456789/473.

    MATH  Google Scholar 

  3. G. P. Donets and L. M. Kolechkina, Extremum Problems on Combinatorial Configurations [in Ukrainian], RVV PUET, Poltava (2011). http://dspace.puet.edu.ua/handle/123456789/560.

    Google Scholar 

  4. O. A. Yemets, T. N. Barbolina, and O. A. Chernenko, “Solving optimization problems with linear-fractional objective functions and additional constraints on arrangements,” Cybern. Syst. Analysis, 42, No. 5, 680–685 (2006).

    Article  MATH  Google Scholar 

  5. O. O. Iemets, Ye. M. Yemets, T. A. Parfionova, and T. V. Chilikina, “Solving linear conditional completely combinatorial optimization problems on permutations by the branch and bound method,” Cybern. Syst. Analysis, 49, No. 2, 264–278 (2013).

    Article  MathSciNet  MATH  Google Scholar 

  6. O. O. Iemets, Ye. M. Yemets, and Yu. F. Oleksiichuk, “Direct of cutoff method for combinatorial optimization problems with additional constraints,” Cybern. Syst. Analysis, 47, No. 6, 932–940 (2011).

    Article  MathSciNet  MATH  Google Scholar 

  7. T. N. Barbolina, “Solution of mixed combinatorial optimization problems on arrangements by the method of construction of lexicographic equivalence,” Cybern. Syst. Analysis, 49, No. 6, 922–931 (2013).

    Article  MathSciNet  MATH  Google Scholar 

  8. I. V. Sergienko and M. V. Mikhalevich, “Applying stochastic optimization methods to analyze transformational processes in economics,” Syst. Doslidzh. ta Inform. Tekhnologii, No. 4, 7–29 (2004).

    Google Scholar 

  9. Yu. M. Ermoliev and A. I. Yastremskii, Stochastic Models and Methods in Economic Planning [in Russian], Nauka, Gl. Red. Fiz.-Mat. Lit., Moscow (1979).

  10. D. B. Yudin, Mathematical Methods of Control under Incomplete Information [in Russian], Sov. Radio, Moscow (1974).

  11. Yu. S. Kan and A. I. Kibzun, Stochastic Programming Problems with Probabilistic Criteria [in Russian], Fizmatlit, Moscow (2009).

    MATH  Google Scholar 

  12. A. B. Naumov and S. V. Ivanov, “Analysis of the stochastic linear programming problem with quantile criterion,” Avtom. Telemekh., No. 2, 142–158 (2011).

    MathSciNet  MATH  Google Scholar 

  13. K. Marti, Stochastic Optimization Methods, Springer-Verlag, Berlin–Heidelberg (2008).

    Book  MATH  Google Scholar 

  14. I. V. Sergienko, Ol. O. Iemets, and Ol. O. Yemets, “Optimization problems with interval uncertainty: Branch and bound method,” Cybern. Syst. Analysis, 49, No. 5, 673–683 (2013).

  15. O. O. Iemets and Ol-ra O. Yemets, Solving Combinatorial Optimization Problems on Fuzzy Sets [in Ukrainian], PUET, Poltava (2011). http://dspace.uccu.org.ua/handle/123456789/352.

  16. O. O. Iemets and T. M. Barbolina, “Optimization problems with probabilistic uncertainty,” Dopovidi NAN Ukrainy, No. 11, 40–45 (2014).

    MATH  Google Scholar 

  17. O. O. Iemets and A. A. Roskladka, “Combinatorial optimization under uncertainty,” Cybern. Syst. Analysis, 44, No. 5, 655–663 (2008).

    Article  MathSciNet  MATH  Google Scholar 

  18. G. H. Hardy, J. E. Littlewood, and G. Polya, Inequalities, Cambridge University Press (1952).

  19. O. O. Iemets and T. M. Barbolina, “Constructing and analyzing the mathematical model of the director mathematical problem with stochastic parameters,” Visnyk Cherkas. Univer., Ser. Prikl. Matem. Informatika, No. 18 (311), 3–11 (2014).

Download references

Author information

Authors and Affiliations

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

    O. O. Iemets

  2. Poltava V. G. Korolenko National Pedagogical University, Poltava, Ukraine

    T. M. Barbolina

Authors
  1. O. O. Iemets
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. T. M. Barbolina
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to O. O. Iemets.

Additional information

Translated from Kibernetika i Sistemnyi Analiz, No. 2, March–April, 2016, pp. 125–136.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Iemets, O.O., Barbolina, T.M. Properties of the Linear Unconditional Problem of Combinatorial Optimization on Arrangements Under Probabilistic Uncertainty. Cybern Syst Anal 52, 285–295 (2016). https://doi.org/10.1007/s10559-016-9825-2

Download citation

  • Received:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10559-016-9825-2

Keywords

Search

Navigation