Steepest ascent algorithms for nonconical multiple objective programming (Q795749)
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: Steepest ascent algorithms for nonconical multiple objective programming |
scientific article; zbMATH DE number 3862957
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Steepest ascent algorithms for nonconical multiple objective programming |
scientific article; zbMATH DE number 3862957 |
Statements
Steepest ascent algorithms for nonconical multiple objective programming (English)
0 references
1984
0 references
steepest ascent algorithms
0 references
continuous variable unconstrained nonconical multiple objective programming
0 references
vector optimization
0 references
0 references
0 references
0.8977022
0 references
0.8916961
0 references
0.88335115
0 references
0.88104546
0 references
0.8793348
0 references
