| Conţinutul numărului revistei |
| Articolul precedent |
| Articolul urmator |
 |
 839 0 |
 SM ISO690:2012EMELICHEV, Vladimir, PLATONOV, Andrey. Measure of quasistability of a vector integer linear programming problem with generalized principle of optimality in the Helder metric. In: Buletinul Academiei de Ştiinţe a Republicii Moldova. Matematica, 2008, nr. 2(57), pp. 58-67. ISSN 1024-7696. |
| EXPORT metadate: Google Scholar Crossref CERIF DataCite Dublin Core |
| Buletinul Academiei de Ştiinţe a Republicii Moldova. Matematica | ||||||
| Numărul 2(57) / 2008 / ISSN 1024-7696 /ISSNe 2587-4322 | ||||||
|
||||||
| Pag. 58-67 | ||||||
|
||||||
 Descarcă PDF |
||||||
| Rezumat | ||||||
A vector integer linear programming problem is considered, principle of
optimality of which is defined by a partitioning of partial criteria into groups with
Pareto preference relation within each group and the lexicographic preference relation between them. Quasistability of the problem is investigated. This type of stability is a discrete analog of Hausdorff lower semicontinuity of the many-valued mapping that defines the choice function. A formula of quasistability radius is derived for the case of metric lp, 1 ≤ p ≤ ∞, defined in the space of parameters of the vector criterion. Similar formulae had been obtained before only for combinatorial (boolean) problems with various kinds of parametrization of the principles of optimality in the cases of l1 and l∞ metrics [1–4], and for some game theory problems [5–7]. |
||||||
| Cuvinte-cheie Vector integer linear programming problem, lexicographic order, generalized effective solution, Pareto set, quasistability radius |
||||||
|
|
|
|
