Premium
A global optimization approach for generating efficient points for multiobjective concave fractional programs
Author(s) -
Benson Harold P.
Publication year - 2005
Publication title -
journal of multi‐criteria decision analysis
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.462
H-Index - 47
eISSN - 1099-1360
pISSN - 1057-9214
DOI - 10.1002/mcda.369
Subject(s) - fractional programming , mathematical optimization , global optimization , multiplicative function , branch and bound , computer science , optimization problem , multi objective optimization , mathematics , nonlinear programming , nonlinear system , mathematical analysis , physics , quantum mechanics
In this article, we present a global optimization approach for generating efficient points for multiobjective concave fractional programming problems. The main work of the approach involves solving an instance of a concave multiplicative fractional program (W̄). Problem (W̄) is a global optimization problem for which no known algorithms are available. Therefore, to render the approach practical, we develop and validate a branch and bound algorithm for globally solving problem (W̄). To illustrate the performance of the global optimization approach, we use it to generate efficient points for a sample multiobjective concave fractional program. Copyright © 2006 John Wiley & Sons, Ltd.