Reverse convex programming approach in the space of extreme criteria for optimization over efficient sets (Q613601)
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: Reverse convex programming approach in the space of extreme criteria for optimization over efficient sets |
scientific article; zbMATH DE number 5828754
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Reverse convex programming approach in the space of extreme criteria for optimization over efficient sets |
scientific article; zbMATH DE number 5828754 |
Statements
Reverse convex programming approach in the space of extreme criteria for optimization over efficient sets (English)
0 references
21 December 2010
0 references
The author reformulates the optimization problem over the efficient set of a linear multiple criteria programming problem as a reverse convex programming problem in the space of extreme criteria. This is achieved by characterization of the efficient set as a reverse convex constraint defined in the space of extreme criteria. A conical branch and bound based algorithm is constructed and some preliminary computational results are reported.
0 references
reverse convex programs
0 references
global optimization
0 references
multiple criteria optimization
0 references
optimization over the efficient set
0 references
space of extreme criteria
0 references
branch and bound methods
0 references
0 references
0 references
0 references
0 references
0.8523181080818176
0 references
0.8329429030418396
0 references
0.8253064751625061
0 references
0.821099579334259
0 references
0.8203921914100647
0 references
