Invex Functions and Generalized Convexity in Multiobjective Programming |
| |
Authors: | Osuna-Gómez R Rufián-Lizana A Ruíz-Canales P |
| |
Institution: | (1) Departamento de Estadística e Investigación Operativa, Facultad de Matemáticas, Universidad de Sevilla, Sevilla, Spain |
| |
Abstract: | Martin (Ref. 1) studied the optimality conditions of invex functions for scalar programming problems. In this work, we generalize his results making them applicable to vectorial optimization problems. We prove that the equivalence between minima and stationary points or Kuhn–Tucker points (depending on the case) remains true if we optimize several objective functions instead of one objective function. To this end, we define accurately stationary points and Kuhn–Tucker optimality conditions for multiobjective programming problems. We see that the Martin results cannot be improved in mathematical programming, because the new types of generalized convexity that have appeared over the last few years do not yield any new optimality conditions for mathematical programming problems. |
| |
Keywords: | Invex functions KT-invex problems Kuhn– Tucker optimality conditions weakly efficient points |
本文献已被 SpringerLink 等数据库收录! |