Second-order duality for nondifferentiable multiobjective programming problems

被引:9
作者
Ahmad, I. [1 ]
Sharma, Sarita [1 ]
机构
[1] Aligarh Muslim Univ, Dept Math, Aligarh 202002, Uttar Pradesh, India
关键词
generalized bonvexity; nondifferentiable multiobjective programming; properly efficient solution; second-order duality;
D O I
10.1080/01630560701563792
中图分类号
O29 [应用数学];
学科分类号
070104 ;
摘要
This paper is concerned with second-order duality for a class of nondifferentiable multiobjective programming problems. Usual duality theorems are proved for Mangasarian type and general Mond-Weir type vector duals under generalized bonvexity assumptions.
引用
收藏
页码:975 / 988
页数:14
相关论文
共 16 条
[11]  
Mond B., 1988, Journal of Information & Optimization Sciences, V9, P331
[12]   CLASS OF NONDIFFERENTIABLE MATHEMATICAL PROGRAMMING PROBLEMS [J].
MOND, B .
JOURNAL OF MATHEMATICAL ANALYSIS AND APPLICATIONS, 1974, 46 (01) :169-174
[13]   ON EFFICIENCY AND DUALITY FOR MULTIOBJECTIVE PROGRAMS [J].
PREDA, V .
JOURNAL OF MATHEMATICAL ANALYSIS AND APPLICATIONS, 1992, 166 (02) :365-377
[14]   STRONG AND WEAK CONVEXITY OF SETS AND FUNCTIONS [J].
VIAL, JP .
MATHEMATICS OF OPERATIONS RESEARCH, 1983, 8 (02) :231-259
[15]   AN OPTIMALITY CONDITION FOR A NONDIFFERENTIABLE CONVEX PROGRAM [J].
WOLKOWICZ, H .
NAVAL RESEARCH LOGISTICS, 1983, 30 (03) :415-418
[16]   Duality for a non-differentiable programming problem [J].
Zhang, J ;
Mond, B .
BULLETIN OF THE AUSTRALIAN MATHEMATICAL SOCIETY, 1997, 55 (01) :29-44