On approximate efficiency in multiobjective programming (Q857826)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: On approximate efficiency in multiobjective programming |
scientific article; zbMATH DE number 5081921
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On approximate efficiency in multiobjective programming |
scientific article; zbMATH DE number 5081921 |
Statements
On approximate efficiency in multiobjective programming (English)
0 references
5 January 2007
0 references
A new definition for approximate efficiency is given for vector, that is, multi-objective optimization. Relations of this new \(\varepsilon\)-efficiency with existing corresponding approximate efficiency concepts are studied. Necessary and sufficient conditions for \(\varepsilon\)-efficiency are presented for convex problems using the well-known weighting method. In this setting, also parametric representations are discussed.
0 references
multi-objective optimization
0 references
\(\varepsilon\)-efficiency
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
