Volume 53, Number 5, November-December 2019
|Page(s)||1601 - 1616|
|Published online||08 October 2019|
On multi-level multi-objective linear fractional programming problem with interval parameters
School of Basic Sciences, Indian Institute of Technology Bhubaneswar, Bhubaneswar, India
* Corresponding author: email@example.com
Accepted: 3 August 2018
This paper develops a method to solve multi-level multi-objective linear fractional programming problem (ML-MOLFPP) with interval parameters as the coefficients of decision variables and the constants involved in both the objectives and constraints. The objectives at each level are transformed into interval-valued fractional functions and approximated by intervals of linear functions using variable transformation and Taylor series expansion. Interval analysis and weighting sum method with analytic hierarchy process (AHP), are used to determine the non-dominated solutions at each level from which the aspiration values of the controlled decision variables are ascertained and linear fuzzy membership functions are constructed for all the objectives. Two multi-objective linear problems are equivalently formulated for the ML-MOLFPP with interval parameters and fuzzy goal programming is used to compute the optimal lower and upper bounds of all the objective values. A numerical example is solved to demonstrate the proposed solution approach.
Mathematics Subject Classification: 90C32 / 90C29 / 90C70
Key words: Multi-level multi-objective optimization / linear fractional programming / interval parameters / fuzzy goal programming
© 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.