Journal of Applied Mathematics
Volume 2011 (2011), Article ID 464832, 21 pages
http://dx.doi.org/10.1155/2011/464832
Research Article

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

Le Quang Thuy, Nguyen Thi Bach Kim, and Nguyen Tuan Thien

Faculty of Applied Mathematics and Informatics, Hanoi University of Technology, Dai Co Viet, Hai Ba Trung, Hanoi, Vietnam

Received 30 November 2010; Revised 7 April 2011; Accepted 28 May 2011

Academic Editor: Ya Ping Fang

Copyright © 2011 Le Quang Thuy et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

Abstract

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.