Generalized invexity and duality in multiobjective nonlinear programming

被引：0

作者：

Laxminarayan Das

Sudarsan Nanda

机构：

[1] Delhi College of Engineering, Delhi

[2] Department of Mathematics, Indian Institute of Technology, Kharagpur

来源：

Journal of Applied Mathematics and Computing | 2003年 / 11卷 / 1-2期

关键词：

Generalized invex; Mond-Weir dual; Multiobjective programming; Proper efficiency;

D O I：

10.1007/BF02935737

中图分类号：

学科分类号：

摘要：

The purpose of this paper is to study the duality theorems in cone constrained multiobjective nonlinear programming for pseudo-invex objectives and quasi-invex constrains and the constraint cones are arbitrary closed convex ones and not necessarily the nonnegative orthants.

引用

页码：273 / 281

页数：8

共 18 条

[1]

Bector C.R.(1988)Duality in pseudo linear multiobjective programming Asia Pacific Journal of Operational Research 5 150-159

[2]

Chandra S.(1986)What is invexity? J. Aust. Math. Soc. Ser. B. 28 1-9

[3]

Prasad Durga(1981)Duality in nonlinear multiple criteria optimization problems Journ. of Optimization Theory and Applications 35 367-401

[4]

Ben-Israel A.(1981)Invex functions and constrained local minima Bull Austral Math. Soc. 24 357-366

[5]

Mond B.(1987)Proper efficiency and multi-objective duality in nonlinear programming J. Inf. Opt. Science 8 155-166

[6]

Bitran G.(1987)Multi-objective duality with invexity J. Math. Anal. Appl. 126 469-477

[7]

Craven B.D.(1968)Proper efficiency and theory of vector maximization J. Math. Anal. Appl. 22 618-630

[8]

Egudo R.R.(1981)On sufficiency of Kuhn-Tucker conditions J. Math. Anal. Appl. 80 545-550

[9]

Egudo R.R.(1985)Optimality criteria in nonlinear programming involving non-convex functions J. Math. Anal. Appl. 105 104-112

[10]

Hanson M.A.(1998)Invex generalization of some duality results Opsearch 25 105-111

← 1 2 →