UNICITY IN LINEAR OPTIMIZATION

被引：7

作者：

GOBERNA, MA ^{[1
]}

LOPEZ, MA ^{[1
]}

TODOROV, M ^{[1
]}

机构：

[1] BULGARIAN ACAD SCI,INST MATH,PLOVDIV,BULGARIA

来源：

JOURNAL OF OPTIMIZATION THEORY AND APPLICATIONS | 1995年 / 86卷 / 01期

关键词：

LINEAR OPTIMIZATION; SEMIINFINITE PROGRAMMING; UNICITY; STRONG UNICITY; FARKAS-MINKOWSKI SYSTEMS;

D O I：

10.1007/BF02193460

中图分类号：

C93 [管理学]; O22 [运筹学];

学科分类号：

070105 ; 12 ; 1201 ; 1202 ; 120202 ;

摘要：

This paper deals with the conditions for the uniqueness of the optimal solution of an optimization problem for which the objective function is linear and the feasible set is a closed convex set in a finite-dimensional space. Some of these conditions, such as strong unicity and w-unicity (a new transition concept), involve only the feasible set. Others are related to the properties of the chosen linear representation. To some extent, the paper surveys the literature about unicity and strong unicity in linear semi-infinite programming.

引用

页码：37 / 56

页数：20

共 19 条

[1] A REFINEMENT OF AN OPTIMALITY CRITERION AND ITS APPLICATION TO PARAMETRIC PROGRAMMING [J].