Charnes-Cooper scalarization and convex vector optimization (Q828709)
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: Charnes-Cooper scalarization and convex vector optimization |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Charnes-Cooper scalarization and convex vector optimization |
scientific article |
Statements
Charnes-Cooper scalarization and convex vector optimization (English)
0 references
5 May 2021
0 references
The Charnes-Cooper scalarization method is employed for deriving Karush-Kuhn-Tucker type optimality conditions that completely characterize efficient (Pareto) solutions to convex vector optimization problems with geometrical constraints. An algorithm based on this technique is also proposed for solving convex vector optimization problems, with computational examples given in order to illustrate its usage.
0 references
convex functions
0 references
multiobjective optimization
0 references
convex optimization
0 references
scalarization techniques
0 references
KKT conditions
0 references
numerical algorithms
0 references
0 references
0.7871990203857422
0 references
0.7821319103240967
0 references
0.7797355651855469
0 references
0.7697948217391968
0 references
