On a quantitative measure of stability for a vector problem in integer programming (Q1571287): Difference between revisions

The authors consider a vector problem of integer optimization with linear partial criteria in the following form \(c^ix\to\min_X,\quad i\in\{1,2,\dots,n\}\), \(c^i\in\mathbb{R}^m\) and \(X\) is a finite set in \(\mathbb{Z}^m\). The vector integer programming problem is posed as the problem of finding the set of efficient (or Pareto optimal) solutions. Quantitative estimates of two types are obtained for the stability of the Pareto set with respect to independent perturbations of the parameters of a vector criterion.