Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
1141696 | Discrete Optimization | 2010 | 16 Pages |
Abstract
We consider multiple objective 0–1 programming problems in the situation where parameters of objective functions and linear constraints are exposed to independent perturbations. We study quantitative characteristics of stability (stability radii) of problem solutions. An approach to deriving formulae and estimations of stability radii is presented. This approach is applied to stability analysis of the linear 0–1 programming problem and problems with two types of nonlinear objective functions: linear absolute value and quadratic.
Related Topics
Physical Sciences and Engineering
Mathematics
Control and Optimization
Authors
Vladimir Emelichev, Dmitry Podkopaev,