Solving ‎F‎ully Interval Linear Programming Problems Using Ranking Interval Numbers‎

Here the general form of an fully Interval linear programming problems (FILP) is considered where all the parameters and variables are considered to be intervals. Moreover, in this study more general conditions for variables are considered, variables which are unrestricted in sign. Although this is the case in most of the real world problems. In this paper a new method is presented in order to obtain FILP.