Journal of Operational Research and Its Applications ( Applied Mathematics ) - Lahijan Azad University

Mendeley  

Zotero  

Allahdadi M, Mishmast Nehi H. New Solution Space for Solving the Interval Linear Programming Model. jor 2017; 14 (2) :111-121
URL: http://jamlu.liau.ac.ir/article-1-1095-en.html

We consider interval linear programming (ILP) problems in the current paper. Best-worst case (BWC) is one of the methods for solving ILP models. BWC determines the values ​​of the target function, but some of the solutions obtained through BWC may result in an infeasible space. To guarantee that solution is completely feasible (i.e. avoid constraints violation), improved two-step method (ITSM) has been proposed. Many solutions are lost in this method. By using an algorithm, we introduce closed ball method (namely, CBM) as a new method for solving ILP models. In this method, feasibility test ensures that solution space is feasible. To demonstrate the effectiveness of the proposed approach, we solve two numeric examples and we compare the results obtained through BWC, ITSM, and CBM.