A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is
This paper presents an algorithm for solving interval linear programming(ILP) problems. Interval inequality constraints and equality constraints are discussed separately. The aim of the paper is to show that (ILP) problems can be decomposed into two general linear programming(LP) by the monotonicity of (LP) problems , and we can gain the interval objective values. Finally, the proposed method have virtually the same results with paper .doi:10.12988/imf.2014.47565 fatcat:6gps7sm7zbd6zb57ffjfyyshdi