Reverse convex programming approach in the space of extreme criteria for optimization over efficient sets (Q613601): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/s10957-010-9721-2 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2071235713 / rank | |||
Normal rank | |||
Revision as of 21:52, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Reverse convex programming approach in the space of extreme criteria for optimization over efficient sets |
scientific article |
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
