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...

Full description

Saved in:
Bibliographic Details
Published in:Computer science journal of Moldova Vol. 28; no. 3(84); pp. 249 - 268
Main Authors: Vladimir A. Emelichev, Yury Nikulin
Format: Journal Article
Language:English
Published: Vladimir Andrunachievici Institute of Mathematics and Computer Science 01.12.2020
Subjects:
ISSN:1561-4042
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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