Linear Optimization
Mehdi Allahdadi; Hasan Mishmast Nehi
Abstract
In this paper, solution space of interval linear programming (ILP) models that is a NP-hard problem, has been considered. In all of the solving methods of the ILP, feasibility condition has been only considered. Best-worst case (BWC) is one of the methods for solving the ILP models. Some of the solutions ...
Read More
In this paper, solution space of interval linear programming (ILP) models that is a NP-hard problem, has been considered. In all of the solving methods of the ILP, feasibility condition has been only considered. Best-worst case (BWC) is one of the methods for solving the ILP models. Some of the solutions obtained by the BWC may result in an infeasible space. To guarantee that solution is completely feasible, improved two-step method (ITSM) is proposed. By using a new approach, we introduce a space for solving ILP models in which by two tests, feasibility and optimality of the obtained space has been guaranteed.