Duality in nondifferentiable vector programming (Q5945939): Difference between revisions

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