Duality theorem of nondifferentiable convex multiobjective programming

From MaRDI portal





Necessary and sufficient conditions of Fritz-John type for Pareto optimality of multiobjective programming problems are derived. This article suggests to establish a Wolfe-type duality theorem for nonlinear, nondifferentiable, convex multiobjective minimization problems. The vector Lagrangian and the generalized saddle point for Pareto optimality are studied. Some previously known results are shown to be special cases of the results described in this paper.




Cited in
(29)








This page was built for publication: Duality theorem of nondifferentiable convex multiobjective programming

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1065718)