On one type of stability for multiobjective integer linear programming problem with parameterized optimality

A multiobjective problem of integer linear programming with parametric optimality is addressed. The parameterization is introduced by dividing a set of objectives into a family of disjoint subsets, within each Pareto optimality is used to establish dominance between alternatives. The introduction of...

Celý popis

Uloženo v:

Podrobná bibliografie
Vydáno v:	Computer science journal of Moldova Ročník 28; číslo 3(84); s. 249 - 268
Hlavní autoři:	Vladimir A. Emelichev, Yury Nikulin
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	Vladimir Andrunachievici Institute of Mathematics and Computer Science 01.12.2020
Témata:	a set of extreme solutions h{\"o}lder's norms integer programming multiobjective problem pareto set stability radius
ISSN:	1561-4042
On-line přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!

Popis
Shrnutí:	A multiobjective problem of integer linear programming with parametric optimality is addressed. The parameterization is introduced by dividing a set of objectives into a family of disjoint subsets, within each Pareto optimality is used to establish dominance between alternatives. The introduction of this principle allows us to connect such classical optimality sets as extreme and Pareto. The admissible perturbation in such problem is formed by a set of additive matrices, with arbitrary H\"{o}lder's norms specified in the solution and criterion spaces. The lower and upper bounds for the radius of strong stability are obtained with some important corollaries concerning previously known results.
ISSN:	1561-4042