The formula of stability radius of a vector linear combinatorial problem is obtained, its principle of optimality defines by a partitioning of partial criteria set into groups with Pareto relation within each group and the jointly-extremal relation between them. = Получена формула радиуса устойчивости векторной линейной комбинаторной задачи, принцип оптимальности которой задается с помощью разбиения множества частных критериев на группы так, что внутри каждой группы действует паретовский принцип, а между группами – совокупно-экстремальный
The quasistability radius for the vector problem of combinatorial optimization with lexicographic pr...
Рассматривается многокритериальная задача дискретной оптимизации на допустимом комбинаторном множест...
We investigate such type of stability of Pareto set in a multicriteria trajectorial (on a system of ...
In this note, the vector combinatorial minimax problem of finding the Pareto set is considered. The ...
Using Helder inequality we derive the stability radius formula for the lexicographic optimum of the ...
A formula of the quasi-stability radius for the vector boolean problem of minimizing absolute deviat...
We obtain lower and upper attainable bounds for the stability radius of the vector Boolean problem w...
The stability of lexicographic optimum of multicryterion problem on the system of subsets of the fin...
A formula of the quasistability radius for the vector integer programming problem with fixed surchar...
A multicriteria variant of a well known extreme combinatorial centers location problem is considered...
We found the optimal linear information and the optimal method of its use to renewal the n-linear fu...
We found the optimal linear information and the optimal method of its use to renewal the bilinear fu...
We found the optimal linear information and the optimal method of its use to renew the n-linear func...
The quasistability radius for the vector problem of combinatorial optimization with lexicographic pr...
Рассматривается многокритериальная задача дискретной оптимизации на допустимом комбинаторном множест...
The quasistability radius for the vector problem of combinatorial optimization with lexicographic pr...
Рассматривается многокритериальная задача дискретной оптимизации на допустимом комбинаторном множест...
We investigate such type of stability of Pareto set in a multicriteria trajectorial (on a system of ...
In this note, the vector combinatorial minimax problem of finding the Pareto set is considered. The ...
Using Helder inequality we derive the stability radius formula for the lexicographic optimum of the ...
A formula of the quasi-stability radius for the vector boolean problem of minimizing absolute deviat...
We obtain lower and upper attainable bounds for the stability radius of the vector Boolean problem w...
The stability of lexicographic optimum of multicryterion problem on the system of subsets of the fin...
A formula of the quasistability radius for the vector integer programming problem with fixed surchar...
A multicriteria variant of a well known extreme combinatorial centers location problem is considered...
We found the optimal linear information and the optimal method of its use to renewal the n-linear fu...
We found the optimal linear information and the optimal method of its use to renewal the bilinear fu...
We found the optimal linear information and the optimal method of its use to renew the n-linear func...
The quasistability radius for the vector problem of combinatorial optimization with lexicographic pr...
Рассматривается многокритериальная задача дискретной оптимизации на допустимом комбинаторном множест...
The quasistability radius for the vector problem of combinatorial optimization with lexicographic pr...
Рассматривается многокритериальная задача дискретной оптимизации на допустимом комбинаторном множест...
We investigate such type of stability of Pareto set in a multicriteria trajectorial (on a system of ...