Multiobjective programming under d-invexity

被引：35

作者：

Antczak, T ^{[1
]}

机构：

[1] Univ Lodz, Fac Math, PL-90238 Lodz, Poland

来源：

EUROPEAN JOURNAL OF OPERATIONAL RESEARCH | 2002年 / 137卷 / 01期

关键词：

multiobjective programming; (weak) Pareto optimal solution; d-invex function with respect to eta; optimality conditions; duality;

D O I：

10.1016/S0377-2217(01)00092-3

中图分类号：

C93 [管理学];

学科分类号：

12 ; 1201 ; 1202 ; 120202 ;

摘要：

In this paper, a generalization of convexity is considered in the case of nonlinear multiobjective programming problem where the functions involved are nondifferentiable. By considering the concept of Pareto optimal solution and substituting d-invexity for convexity, the Fritz John type and Karush-Kuhn-Tucker type necessary optimality conditions and duality in the sense of Mond-Weir and Wolfe for nondifferentiable multiobjective programming are given. (C) 2002 Elsevier Science B.V. All rights reserved.

引用

页码：28 / 36

页数：9

共 16 条

[1]

[Anonymous], 2004, NONLINEAR PROGRAMMIN

[2] WHAT IS INVEXITY [J].