A modified two-step method for solving interval linear programming problems

摘要: In this paper, we propose a new method for solving interval linear programming (ILP) problems. For the ILP problems, two important items should be considered: feasibility (i.e., solutions satisfy all constraints) and optimality are optimal at least characteristic model). some methods, part of solution space is infeasible it violates any such as best worst cases (BWC) proposed by Tong in 1994 two-step (TSM) Huang et al. 1995. completely feasible, but not points optimal) modified (MILP) Zhou 2009 improved TSM (ITSM) Wang 2014. Firstly, basis stability problems reviewed. Secondly, methods analysed from point view conditions. Later, which modifies using approach presented. This gives that only also optimal.