General solutions for linear programming with interval right hand side

被引：0
|
作者：
Li, Wei [1 ]
Wang, Gui-Xiang [1 ]
机构：
[1] Hangzhou Dianzi Univ, Sch Sci, Hangzhou 310018, Peoples R China
来源：
PROCEEDINGS OF 2006 INTERNATIONAL CONFERENCE ON MACHINE LEARNING AND CYBERNETICS, VOLS 1-7 | 2006年
基金：
美国国家科学基金会;
关键词：
linear programming; interval analysis; Moore-Penrose inverse;
D O I：
暂无
中图分类号：
TP [自动化技术、计算机技术];
学科分类号：
0812 ;
摘要：
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.
引用
收藏
页码：1836 / +
页数：2
相关论文
共 50 条
12345