STRONG UNICITY AND ALTERNATION FOR LINEAR OPTIMIZATION

被引：7

作者：

FISCHER, T

机构：

[1] Fachbereich Mathematik, Johann Wolfgang Goethe-Universität, Frankfurt

来源：

JOURNAL OF OPTIMIZATION THEORY AND APPLICATIONS | 1991年 / 69卷 / 02期

关键词：

LINEAR SEMI-INFINITE OPTIMIZATION; PARAMETRIC PROGRAMMING; STRONG UNICITY; ALTERNATION; HAAR THEOREM;

D O I：

10.1007/BF00940642

中图分类号：

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

学科分类号：

070105 ; 12 ; 1201 ; 1202 ; 120202 ;

摘要：

We consider linear semi-infinite optimization problems and prove characterizations for strong unicity. One of these is a weak alternation property. This result suggests the introduction of the property of regular strong unicity, which is equivalent to a stronger alternation property. The theorems are used in order to prove a Haar-type theorem for linear optimization problems. An application to best Chebyshev approximation is given.

引用

页码：251 / 267

页数：17

共 20 条

[1]

Bartelt M. W., 1973, Journal of Approximation Theory, V9, P255, DOI 10.1016/0021-9045(73)90091-9

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