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.
Recommendations
- scientific article; zbMATH DE number 633408
- Sufficiency and duality in nondifferentiable multiobjective programming
- Optimality conditions and duality in subdifferentiable multiobjective fractional programming
- Fritz John's type conditions and associated duality forms in convex non differentiable vector-optimization
- scientific article; zbMATH DE number 3910154
Cites work
- A duality theorem for non-linear programming
- A subgradient duality theorem
- Duality in vector optimization
- Duality theory in multiobjective programming
- scientific article; zbMATH DE number 3756249 (Why is no real title available?)
- scientific article; zbMATH DE number 3625127 (Why is no real title available?)
- More on subgradient duality
- Necessary conditions for optimality of nondifferentiable convex multiobjective programming
- Pareto optimality in multiobjective problems
- Some minimax theorems in vector-valued functions
- Weak Pareto optimality of multiobjective problems in a locally convex linear topological space
Cited in
(29)- An N-person non-cooperative discounted vector-valued dynamic game with a metric space
- Moreau-Rockafellar type theorem for convex set functions
- On a D-solution of a cooperative m-person discounted Markov game
- Optimality for set functions with values in ordered vector spaces
- Sufficiency and duality in nondifferentiable multiobjective programming
- Vector saddle-point and distributed parameter differential games
- Duality for a minimax programming problem containing n-set functions
- Alternative theorems and saddlepoint results for convex programming problems of set functions with values in ordered vector spaces
- Optimality conditions and duality in subdifferentiable multiobjective fractional programming
- Dual conditions characterizing optimality for convex multi-objective programs.
- New optimality conditions for a nondifferentiable fractional semipreinvex programming problem
- On sufficiency and duration in nonsmooth multiobjective programming.
- Duality for nonsmooth multiobjective fractional programs under generalized (F,)-convexity.
- Multiplier rules for weak pareto optimization problems
- On multiobjective nonlinear programming with support functions
- scientific article; zbMATH DE number 4152161 (Why is no real title available?)
- scientific article; zbMATH DE number 4160490 (Why is no real title available?)
- scientific article; zbMATH DE number 3910154 (Why is no real title available?)
- Saddlepoint Theory for Nondifferentiable Multiobjective Fractional Programming
- scientific article; zbMATH DE number 3963587 (Why is no real title available?)
- scientific article; zbMATH DE number 14317 (Why is no real title available?)
- Axiomatic approach to duality in optimization
- scientific article; zbMATH DE number 633408 (Why is no real title available?)
- scientific article; zbMATH DE number 4121782 (Why is no real title available?)
- Fritz John's type conditions and associated duality forms in convex non differentiable vector-optimization
- scientific article; zbMATH DE number 927531 (Why is no real title available?)
- On the Fritz John saddle point problem for differentiable multiobjective optimization
- Duality in nondifferentiable vector programming
- Wolfe-type duality for mathematical programs with switching constraints
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)