论文信息 - On efficient applications of G-Karush-Kuhn-Tucker necessary optimality theorems to multiobjective programming problems

On efficient applications of G-Karush-Kuhn-Tucker necessary optimality theorems to multiobjective programming problems

We prove a slightly modified G-Karush-Kuhn-Tucker necessary optimality theorem for multiobjective programming problems, which was originally given by Antczak (J Glob Optim 43:97–109, 2009), and give an example showing the efficient application of (modified) G-Karush-Kuhn-Tucker optimality theorem to the problems.

Gue Myung Lee | Moon Hee Kim

[1] Tadeusz Antczak. On G-invex multiobjective programming. Part I. Optimality , 2009, J. Glob. Optim..

[2] 한동석,et al. 효울적인 훈련열 및 이에 대한 간단한 역행렬을 이용하여 채널을 추정하는 무선 통신 시스템 , 2009 .

[3] Panos M. Pardalos,et al. A survey of recent developments in multiobjective optimization , 2007, Ann. Oper. Res..

[4] A. M. Geoffrion. Proper efficiency and the theory of vector maximization , 1968 .

[5] Panos M. Pardalos,et al. Optimality Conditions and Duality for Multiobjective Programming Involving (C, α, ρ, d) type-I Functions , 2007 .

[6] Tadeusz Antczak. On G-invex multiobjective programming. Part II. Duality , 2009, J. Glob. Optim..

[7] J. Lin. Maximal vectors and multi-objective optimization , 1976 .

[8] Hirotaka Nakayama,et al. Theory of Multiobjective Optimization , 1985 .

[9] Tadeusz Antczak. New optimality conditions and duality results of G type in differentiable mathematical programming , 2007 .

[10] Olvi L. Mangasarian,et al. Nonlinear Programming , 1969 .

[11] A. Ruszczynski,et al. Nonlinear Optimization , 2006 .