Interval linear fractional programming;
g-division;
Interval linear programming;
Interval arithmetic;
OPTIMIZATION;
DIFFERENCE;
D O I:
10.1007/s12065-024-00968-x
中图分类号:
TP18 [人工智能理论];
学科分类号:
081104 ;
0812 ;
0835 ;
1405 ;
摘要:
In this paper, we study the interval linear fractional programming problems using the concept of g-division. We transform the problem into a new linear fractional programming problem and obtain a nondominated solution to the interval linear fractional programming problem. We show that the new solution dominates the previous nondominated objective value presented in the literature. Finally, some examples are provided to illustrate our results.