scientific article; zbMATH DE number 12754
This paper defines duality for a multiobjective programming problem in the case when the functions involved are not assumed differentiable and a constraint qualification is not required. The results, named strong duality and weak duality, are proved for a convex multiobjective programming, for a convex/concave multiobjective fractional programming and for a multiobjective problem, where the objectives are homogeneous functions (the objective functions take the form of either the sum of a convex differentiable functions and a positively homogeneous convex function or a ratio of such functions). Previous results of Ben-Israel, Ben-Tal, Zlobec, Geoffrion, Mond, Weir and Wolfe are obtained as special cases and an example is given.
- Duality without a constraint qualification for minimax fractional programming
- Duality for some nondifferentiable static multiobjective programming problems
- Duality without constraint qualification in nonsmooth optimization
- Multiobjective Programming Strong Vector Duality
- scientific article; zbMATH DE number 3847230 (Why is no real title available?)
- Duality without constraint qualification for multiobjective programming
- scientific article; zbMATH DE number 232392 (Why is no real title available?)
- A new Fenchel dual problem in vector optimization
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3978710)
