Overview of solution methods for solving interval linear programming and new method

In this paper, we review previous methods for solving interval linear programming (ILP) problems. In most of these methods such as BWC, ILP, TSM, and SOM-2 methods, part of solution space is absolutely infeasible and non-optimal. To eliminate infeasible part of solution space, several methods such as MILP, and ITSM are proposed. The solution space of these methods is absolutely feasible and is not completely optimal. Also, we introduce new method to improve SOM-2 method that is called ISOM-2 method and its sub-models. The solution space of ISOM-2 method is absolutely feasible and optimal.