RO EN
Quasistability of the vector L∞ -extreme combinatorial problem with Pareto principle of optimalite.
Authors: Emelichev V. A., Leonovich A. M.
Abstract
We consider the vector trajectorial (on a system of subsets of a finite set) problem with partial criteria of the kind MINMAX MODUL. The parameters of these criteria are exposed to “small” independent perturbations in Chebyshev norm. We consider such type of stability of the problem that all efficient (Pareto optimal) solutions of the initial problem are preserved in a perturbing problem and new efficient solutions can appear. The necessary and sufficient conditions have been obtained.E-mail:
Contents
- temp
- Algebraical equivalences of topological spaces.
- A note on RK - and CRK -manifolds.
- Quasistability of the vector L∞ -extreme combinatorial problem with Pareto principle of optimalite.
- On some problem of the tangency of sets.
- On the character group and Brauer group of rational function field over a pseudoglobal field.
- A criterion for parametrical completeness in the 4-valued extension of modal logic S5.
- Probabilities in the Extended Matching model.
- The GL(2, R) -orbits of differential system with cubic homogeneities.
