Duality in Nondifferentiable Vector Programming

AbstractIn this paper we study the saddle point optimality conditions and Lagrange duality in multiobjective optimization for generalized subconvex-like functions. We obtain results which will allow us to characterize the solutions for multiobjective programming problems from the saddle point conditions and allow us to relate them to the dual problem solutions which will be adequately defined. We also define a new dual problem for the multiobjective programming problem with the special property of being a scalar programming problem