Efficiency equivalent polyhedra for the feasible set of multiple objective linear programming (Q700265)
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: Efficiency equivalent polyhedra for the feasible set of multiple objective linear programming |
scientific article; zbMATH DE number 1809838
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Efficiency equivalent polyhedra for the feasible set of multiple objective linear programming |
scientific article; zbMATH DE number 1809838 |
Statements
Efficiency equivalent polyhedra for the feasible set of multiple objective linear programming (English)
0 references
23 November 2003
0 references
The author studies a multiobjective programming problem in which the ordering cone induced by criteria functions is pointed and has a nonempty interior. An outer approximation algorithm is proposed for determining all extreme points and constructing efficiency equivalent polyhedron whose data size is, normally, smaller than that of the original set.
0 references
multiobjective linear programming
0 references
efficiency equivalent
0 references
extreme efficient point
0 references
outer approximation
0 references
0.8644663691520691
0 references
0.8234731554985046
0 references
0.8234164714813232
0 references
0.8104390501976013
0 references
