A computationally efficient algorithm for determination of efficient max-ordering optimal solutions in multiple objective programming (Q2479138)
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 5253827
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A computationally efficient algorithm for determination of efficient max-ordering optimal solutions in multiple objective programming |
scientific article; zbMATH DE number 5253827 |
Statements
A computationally efficient algorithm for determination of efficient max-ordering optimal solutions in multiple objective programming (English)
0 references
26 March 2008
0 references
weakly efficient
0 references
multi-objective programming
0 references
max-ordering
0 references
lexicographic max-ordering
0 references
algorithm
0 references
numerical examples
0 references
0.7703772187232971
0 references
0.7690312266349792
0 references
0.7663835287094116
0 references
0.7654274702072144
0 references
