Document Type : Original Article
Authors
1 Mathematics Department, University of Sistan and Baluchestan, Zahedan, Iran
2 Mathematics Faculty‎, ‎University of Sistan and Baluchestan‎, ‎Zahedan‎, ‎Iran
Abstract
Purpose: Determining efficient solutions of the Interval Multi Objective Linear Fractional Programming (IMOLFP) model is generally an NP-hard problem. For determining the efficient solutions, an effective method has not yet been proposed. So, we need to have an appropriate method to determine the efficient solutions of the IMOLFP. For the first time, we want to introduce algorithms in which the strongly and weakly efficient solutions of the IMOLFP are obtained.
Methodology: In this paper, we introduce two algorithms such that in one, strongly feasible of inequalities and in the other, weakly feasible of inequalities are considered (A system of inequalities is strongly feasible if and only if the smallest region is feasible, and a system of inequalities is weakly feasible if and only if the largest region is feasible). We transform the objective functions of the IMOLFP to real linear functions and then convert to a single objective linear model and then in each iteration of the algorithm, we add some new constraints to the feasible region. By selecting an arbitrary point of the feasible region as start point and using the proposed algorithms, we obtain the strongly and weakly efficient solutions of the IMOLFP.
Findings: In both proposed algorithms, we obtain an efficient solution by selecting the arbitrary points, and by changing the starting point, we obtain a new point as the efficient solution.
Originality/Value: In this research, for the first time, we have been able to obtain the strongly and weakly efficient solutions of the IMOLFP.
Keywords
- Multi objective programming
- Interval linear fractional programming
- Strongly efficient solution
- Weakly efficient solution
Main Subjects
)