No label defined (Q3978710)
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 12754
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | No label defined |
scientific article; zbMATH DE number 12754 |
Statements
25 June 1992
0 references
multiobjective programming
0 references
strong duality
0 references
weak duality
0 references
0.934684991836548
0 references
0.9262388348579408
0 references
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.
0 references
