RO EN
On quasistability of a vector combinatorial problem with Σ-MINMAX and Σ-MINMIN partial criteria
Authors: Vladimir A. Emelichev, Kirill G. Kuzmin, Andrey M. Leonovich
Keywords: Vector trajectorial problem, the Pareto set, quasi-stability.
– 0.19 Mb
Keywords: Vector trajectorial problem, the Pareto set, quasi-stability.
Abstract
We consider one type of stability (quasistability) of a vector combinatorial problem of finding the Pareto set. Under quasistability we understand a discrete analogue of lower semicontinuity by Hausdorff of the many-valued mapping, which defines the Pareto choice function. A vector problem on a system of subsets of a finite set (trajectorial problem) with non-linear partial criteria is in focus. Two necessary and sufficient conditions for stability of this problem are proved. Mathematics Subject Classification: 2000, 90C10, 90C05, 90C29, 90C31V. A. Emelichev, K. G. Kuzmin, A. M. Leonovich
Belorussian State University,
Mechanics-Mathematics Department,
ave. Fr. Skoriny, 4, Minsk, 220050, Belarus.
E-mail:
Belorussian State University,
Mechanics-Mathematics Department,
ave. Fr. Skoriny, 4, Minsk, 220050, Belarus.
E-mail:
Fulltext
– 0.19 Mb
Contents
- On quasistability of a vector combinatorial problem with Σ-MINMAX and Σ-MINMIN partial criteria
- Real Time Embedded Moving Objects Detector - Study and Implementation Within Virtex FPGA Technology
- Contrastive Meanings of the Terms "Predicative" and "Predicational" in Various Linguistic Theories (II)
- Deductive databases and P systems
- Software Development Processes
- NeoSite: A simple Content Management System
- Symbolic Deductive Reasoning using Connectionist Models
- Information about the Second Conference of the Mathematical Society of the Republic of Moldova
