Note: An algorithm to solve polyhedral convex set optimization problems (Q2808332)
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: Note: An algorithm to solve polyhedral convex set optimization problems |
scientific article; zbMATH DE number 6583804
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Note: An algorithm to solve polyhedral convex set optimization problems |
scientific article; zbMATH DE number 6583804 |
Statements
Note: An algorithm to solve polyhedral convex set optimization problems (English)
0 references
23 May 2016
0 references
set-valued optimization
0 references
set relation
0 references
set criterion
0 references
vector optimization
0 references
infimum attainment
0 references
0.93984205
0 references
0.8849741
0 references
0.88453484
0 references
0.8824646
0 references
0.8806455
0 references
0.8781686
0 references
