Optimization over the efficient set of a bicriteria convex programming problem (Q4908852)
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: Optimization over the efficient set of a bicriteria convex programming problem |
scientific article; zbMATH DE number 6142614
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Optimization over the efficient set of a bicriteria convex programming problem |
scientific article; zbMATH DE number 6142614 |
Statements
7 March 2013
0 references
global optimization
0 references
optimization over the efficient set
0 references
outcome set
0 references
bicriteria convex programming
0 references
outer approximation
0 references
branch-and-reduce scheme
0 references
0.8268228769302368
0 references
0.8219213485717773
0 references
0.8200034499168396
0 references
