Generating Efficient Outcome Points for Convex Multiobjective Programming Problems and Its Application to Convex Multiplicative Programming

Abstract EN

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.