UDC 519.85

Linear unconditional problem of combinatorial optimization on arrangements under probabilistic uncertainty

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. Tabl.: 2. Refs: 19 titles.

Keywords:

probabilistic uncertainty, discrete random variable, Euclidean combinatorial optimization problem, optimization on arrangements.


FULL TEXT

About author(s):

Емец Олег Алексеевич, доктор физ.-мат. наук, профессор, заведующий кафедрой Полтавского университета экономики и торговли,
e-mail: yemetsli@ukr.net

Барболина Татьяна Николаевна, кандидат физ.-мат. наук, доцент, заведующая кафедрой Полтавского национального педагогического университета им. В.Г. Короленко,
e-mail: tn_b@rambler.ru