Complete efficiency and the initialization of algorithms for multiple objective programming (Q1183391)
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 33257
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Complete efficiency and the initialization of algorithms for multiple objective programming |
scientific article; zbMATH DE number 33257 |
Statements
Complete efficiency and the initialization of algorithms for multiple objective programming (English)
0 references
28 June 1992
0 references
Complete efficiency means that the set of all efficient points of a multiple objective programming problem equals the whole feasible set. This paper presents characterizations for complete efficiency in the nonlinear and linear case. The given test problems can also be used for the initialization of certain algorithms.
0 references
Complete efficiency
0 references
efficient points
0 references
multiple objective programming
0 references
0 references
0.7574390769004822
0 references
0.7522069811820984
0 references
0.7460544109344482
0 references
