OPTIMIZATION IN LINEAR PROGRAMMING PROBLEMS WITH THE SPARSE MATRIX

被引：0
|
作者：
Ioan, Popoviciu [1 ]
机构：
[1] Naval Acad Mircea Cel Batran, Constanta, Romania
来源：
15TH INTERNATIONAL CONFERENCE THE KNOWLEDGE-BASED ORGANIZATION: APPLIED TECHNICAL SCIENCES AND ADVANCED MILITARY TECHNOLOGIES, CONFERENCE PROCEEDINGS 6 | 2009年 / 6卷
关键词：
D O I：
暂无
中图分类号：
TP39 [计算机的应用];
学科分类号：
081203 ; 0835 ;
摘要：
When speaking about linear programming problems of big dimensions with rare matrix of the system, resolved through simplex method, it is necessary, at each iteration, to calculate the inverse of the base matrix, which leads to the loss of the rarity character of the matrix. The article proposes the replacement of the calculus of the inverse of the base matrix with the solving through iterative parallel methods of a linear system with rare matrix of the system.
引用
收藏
页码：138 / 142
页数：5
相关论文
共 50 条
12345