DUALITY THEOREMS FOR CONVEX-PROGRAMMING WITHOUT CONSTRAINT QUALIFICATION

被引:4
作者
KANNIAPPAN, P
机构
[1] GANDHIGRAM RURAL INST,DEPT MATH,GANDHIGRAM 624302,TAMIL NADU,INDIA
[2] MADURAI KAMARAJ UNIV,SCH MATH,MADURAI 625021,TAMIL NADU,INDIA
来源
JOURNAL OF THE AUSTRALIAN MATHEMATICAL SOCIETY SERIES A-PURE MATHEMATICS AND STATISTICS | 1984年 / 36卷 / APR期
关键词
D O I
10.1017/S144678870002468X
中图分类号
O1 [数学];
学科分类号
0701 ; 070101 ;
摘要
引用
收藏
页码:253 / 266
页数:14
相关论文
共 22 条
[1]  
Barbu V., 1986, CONVEXITY OPTIMIZATI
[2]  
BENISRAEL A, 1978, SURVEY MATH PROGRAMM
[3]   CHARACTERIZATION OF OPTIMALITY IN CONVEX PROGRAMMING WITHOUT A CONSTRAINT QUALIFICATION [J].
BENTAL, A ;
BENISRAEL, A ;
ZLOBEC, S .
JOURNAL OF OPTIMIZATION THEORY AND APPLICATIONS, 1976, 20 (04) :417-437
[4]   CHARACTERIZATION OF OPTIMALITY FOR THE ABSTRACT CONVEX PROGRAM WITH FINITE DIMENSIONAL RANGE [J].
BORWEIN, JM ;
WOLKOWICZ, H .
JOURNAL OF THE AUSTRALIAN MATHEMATICAL SOCIETY SERIES A-PURE MATHEMATICS AND STATISTICS, 1981, 30 (APR) :390-411
[5]  
Craven B. D., 1976, Journal of the Australian Mathematical Society, Series B (Applied Mathematics), V19, P462, DOI 10.1017/S0334270000001326
[6]  
HOLMES RB, 1972, LECTURE NOTES MATH, V247
[7]  
Ioffe A., 1979, THEORY EXTREMAL PROB
[8]  
Kanniappan P., 1980, Bulletin of the Australian Mathematical Society, V22, P145, DOI 10.1017/S0004972700006419
[9]  
KANNIAPPAN P, 1982, J AUSTR MATH SOC A, V32
[10]  
KUHN HW, 1951, NONLINEAR PROGRAMMIN, P481