Stability and regularization of the lexicographic vector problem of quadratic discrete programming

被引:1
作者
Emelichev, VA [1 ]
Yanushkevich, OA
机构
[1] Belarusian State Univ, Minsk 220050, BELARUS
[2] Natl Acad Sci Belarus, Inst Tech Cybernet, Minsk, BELARUS
关键词
stability; regularization lexicographic vector problem; quadratic discrete programming;
D O I
10.1007/BF02678665
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
The paper studies the bounds of variation of input parameters for a vector quadratic discrete optimization problem, which do not expand the set of lexicographic optima. A stability criterion is described and a regularization method is presented, which makes it possible to pass from a possibly unstable problem to a series of perturbed stable problems with a previous set of lexicographic optima.
引用
收藏
页码:196 / 202
页数:7
相关论文
共 15 条
  • [1] BERDYSHEVA RA, 1999, KIBERN SIST ANAL, P83
  • [2] Emelichev V. A, 1998, ZH VYCH MAT MAT FIZ, V38, P1801
  • [3] EMELICHEV VA, 1999, KIBERN SIST ANAL, P125
  • [4] EMELICHEV VA, 1995, KIBERN SIST ANAL, P137
  • [5] EMELICHEV VA, 1998, KIBERN SIST ANAL, P144
  • [6] EREMIN II, 1973, SIB MAT ZH, V14, P53, DOI DOI 10.1007/BF00967264
  • [7] KOZERATSKAYA LN, 1993, KIBERN SIS ANAL, P173
  • [8] KOZERATSKAYA LN, 1988, KIBERNETIKA, P41
  • [9] MOLODTSOV DA, 1987, STABILITY OPTIMALLY
  • [10] NEFEDOV VN, 1983, ZH VYCHISL MAT MAT F, V23, P1326