Generating efficient outcome points for convex multiobjective programming problems and its application to convex multiplicative programming (Q642767)
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: Generating efficient outcome points for convex multiobjective programming problems and its application to convex multiplicative programming |
scientific article; zbMATH DE number 5964445
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Generating efficient outcome points for convex multiobjective programming problems and its application to convex multiplicative programming |
scientific article; zbMATH DE number 5964445 |
Statements
Generating efficient outcome points for convex multiobjective programming problems and its application to convex multiplicative programming (English)
0 references
27 October 2011
0 references
Summary: Convex multiobjective programming problems and multiplicative programming problems have important applications in areas such as finance, economics, bond portfolio optimization, engineering, and other fields. This paper presents a quite easy algorithm for generating a number of efficient outcome solutions for convex multiobjective programming problems. As an application, we propose an outer approximation algorithm in the outcome space for solving the multiplicative convex program. The computational results are provided on several test problems.
0 references
0 references
0 references
0 references
0 references
0 references
0.8438712358474731
0 references
0.8438712358474731
0 references
0.8144572377204895
0 references
0.8047436475753784
0 references
0.7973608374595642
0 references
