Mixed duality without constraint qualification for nonsmooth fractional programming

被引：1

作者：

Nobakhtian, S. ^{[1
]}

机构：

[1] Univ Isfahan, Dept Math, Esfahan, Iran

来源：

NUMERICAL FUNCTIONAL ANALYSIS AND OPTIMIZATION | 2007年 / 28卷 / 11-12期

关键词：

efficient solution; mixed duality; multiobjective fractional problems; nonsmooth analysis;

D O I：

10.1080/01630560701766692

中图分类号：

O29 [应用数学];

学科分类号：

070104 ;

摘要：

A class of nonsmooth multiobjective fractional programming is formulated. We establish the necessary and sufficient optimality conditions without the need of a constraint qualification. Then a mixed dual is introduced for a class of nonsmooth fractional programming problems, and various duality theorems are established without a constraint qualification.

引用

页码：1355 / 1367

页数：13

共 50 条

[1] Mixed duality without a constraint qualification for minimax fractional programming
Zhou, HC
Sun, WY
[J]. OPTIMIZATION, 2003, 52 (4-5) : 617 - 627
[2] Duality Without a Constraint Qualification for Minimax Fractional Programming
H. C. Lai
J. C. Liu
K. Tanaka
[J]. Journal of Optimization Theory and Applications, 1999, 101 : 109 - 125
[3] Duality without a constraint qualification for minimax fractional programming
Lai, HC
Liu, JC
Tanaka, K
[J]. JOURNAL OF OPTIMIZATION THEORY AND APPLICATIONS, 1999, 101 (01) : 109 - 125
[4] DUALITY FOR FRACTIONAL-PROGRAMMING WITHOUT A CONSTRAINT QUALIFICATION
WEIR, T
MOND, B
[J]. UTILITAS MATHEMATICA, 1990, 38 : 193 - 197
[5] DUALITY WITHOUT CONSTRAINT QUALIFICATION FOR MULTIOBJECTIVE FRACTIONAL-PROGRAMMING
WEIR, T
MOND, B
EGUDO, RR
[J]. ASIA-PACIFIC JOURNAL OF OPERATIONAL RESEARCH, 1992, 9 (02) : 195 - 206
[6] DUALITY WITHOUT CONSTRAINT QUALIFICATION FOR MULTIOBJECTIVE PROGRAMMING
EGUDO, RR
WEIR, T
MOND, B
[J]. JOURNAL OF THE AUSTRALIAN MATHEMATICAL SOCIETY SERIES B-APPLIED MATHEMATICS, 1992, 33 : 531 - 544
[7] MULTIPLE OBJECTIVE PROGRAMMING DUALITY WITHOUT A CONSTRAINT QUALIFICATION
WEIR, T
MOND, B
[J]. UTILITAS MATHEMATICA, 1991, 39 : 41 - 55
[8] Optimality and duality without a constraint qualification for minimax programming
Zhou, HC
Sun, WY
[J]. BULLETIN OF THE AUSTRALIAN MATHEMATICAL SOCIETY, 2003, 67 (01) : 121 - 130
[9] DUALITY THEOREMS FOR CONVEX-PROGRAMMING WITHOUT CONSTRAINT QUALIFICATION
KANNIAPPAN, P
[J]. JOURNAL OF THE AUSTRALIAN MATHEMATICAL SOCIETY SERIES A-PURE MATHEMATICS AND STATISTICS, 1984, 36 (APR): : 253 - 266
[10] DUALITY FOR GENERALIZED CONVEX-PROGRAMMING WITHOUT A CONSTRAINT QUALIFICATION
WEIR, T
MOND, B
[J]. UTILITAS MATHEMATICA, 1987, 31 : 233 - 242

← 1 2 3 4 5 →