论文信息 - An Algorithm for Solving Interval Linear Programming Problems

An Algorithm for Solving Interval Linear Programming Problems

This paper presents an algorithm for solving interval linear programming (IP) problems. The algorithm is a finite iterative method. At each iteration it solves a full row rank, (IP) problem with only one additional constraint.

[1] Abraham Charnes,et al. Modular Design, Generalized Inverses, and Convex Programming , 1965 .

[2] Abraham Charnes,et al. An Explicit Solution of a Special Class of Linear Programming Problems , 1968, Oper. Res..

[3] Adi Ben-Israel,et al. A suboptimization method for interval linear programming: a new method for linear programming , 1970 .

[4] P. D Robers,et al. An interval programming algorithm for discrete linear L1 approximation problems , 1969 .

[5] A. Charnes. Optimality and Degeneracy in Linear Programming , 1952 .