Duality theorem of nondifferentiable convex multiobjective programming (Q1065718)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 3924532
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Duality theorem of nondifferentiable convex multiobjective programming |
scientific article; zbMATH DE number 3924532 |
Statements
Duality theorem of nondifferentiable convex multiobjective programming (English)
0 references
1986
0 references
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.
0 references
Pareto optimality
0 references
multiobjective programming
0 references
duality
0 references
nonlinear nondifferentiable convex multiobjective minimization
0 references
generalized saddle point
0 references
optimality conditions
0 references
0 references
0 references
0.8926770687103271
0 references
0.890382707118988
0 references
0.8821249604225159
0 references
