Volume 53, Number 4, October 2019
|Page(s)||1229 - 1244|
|Published online||29 July 2019|
A computationally efficient algorithm to approximate the pareto front of multi-objective linear fractional programming problem
Mathematical Institute of the Serbian Academy of Sciences and Arts, Serbia
2 Faculty of Organizational Sciences, University of Belgrade, Serbia
* Corresponding author: email@example.com
Accepted: 19 September 2018
The main contribution of this paper is the procedure that constructs a good approximation to the non-dominated set of multiple objective linear fractional programming problem using the solutions to certain linear optimization problems. In our approach we propose a way to generate a discrete set of feasible solutions that are further used as starting points in any procedure for deriving efficient solutions. The efficient solutions are mapped into non-dominated points that form a 0th order approximation of the Pareto front. We report the computational results obtained by solving random generated instances, and show that the approximations obtained by running our procedure are better than those obtained by running other procedures suggested in the recent literature. We evaluated the quality of each approximation using classic metrics.
Mathematics Subject Classification: 90C29 / 90C32
Key words: Fractional programming / multiple objective programming / efficient solution / non-dominated point / 0th order approximation
© EDP Sciences, ROADEF, SMAI 2019
Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.
Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.
Initial download of the metrics may take a while.