GENERAL SOLUTIONS FOR LINEAR PROGRAMMING WITH INTERVAL RIGHT HAND SIDE

摘要：

In present paper, a simple approach is proposed for linear programming with interval right hand side. Instead of solving linear programming by iterative methods, it is proposed a direct method simply to deal with Moore-Penrose inverse of the constraint matrix. The technique described is easily extended to more general types of linear programming with both interval right hand side and bound constraints.

关键词： Linear programming interval analysis Moore-Penrose inverse

作者: WEI LI GUI-XIANG WANG

作者单位: School of Science, Hangzhou Dianzi University, Hangzhou 310018, China

会议类型: 国际会议

会议名称: 2006 International Conference on Machine Learning and Cybernetics(IEEE第五届机器学习与控制论坛)

会议地点: 大连

会议语种:英文

页码: 1836-1839

在线出版日期: 2006-08-13（万方平台首次上网日期，不代表论文的发表时间）