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 条
  • [1] Linear programming problems and matrix games
    Stefanov, Stefan M.
    JOURNAL OF INTERDISCIPLINARY MATHEMATICS, 2024, 27 (01) : 57 - 65
  • [2] Sparse Linear Least Squares Problems in Optimization
    Pontus Matstoms
    Computational Optimization and Applications, 1997, 7 : 89 - 110
  • [3] Sparse linear least squares problems in optimization
    Matstoms, P
    COMPUTATIONAL OPTIMIZATION AND APPLICATIONS, 1997, 7 (01) : 89 - 110
  • [4] Optimization and Reoptimization in Fuzzy Linear Programming problems
    Kheirfam, Behrouz
    Luis Verdegay, Jose
    PROCEEDINGS OF THE 8TH CONFERENCE OF THE EUROPEAN SOCIETY FOR FUZZY LOGIC AND TECHNOLOGY (EUSFLAT-13), 2013, 32 : 527 - 533
  • [5] Optimization approaches to possibilistic linear programming problems
    Inuiguchi, M
    Tanino, T
    Tanaka, H
    JOINT 9TH IFSA WORLD CONGRESS AND 20TH NAFIPS INTERNATIONAL CONFERENCE, PROCEEDINGS, VOLS. 1-5, 2001, : 2724 - 2729
  • [6] CORRECTED SEQUENTIAL LINEAR-PROGRAMMING FOR SPARSE MINIMAX OPTIMIZATION
    JONASSON, K
    MADSEN, K
    BIT, 1994, 34 (03): : 372 - 387
  • [7] SparsePOP - A sparse semidefinite programming relaxation of polynomial optimization problems
    Waki, Hayato
    Kim, Sunyoung
    Kojima, Masakazu
    Muramatsu, Masakazu
    Sugimoto, Hiroshi
    ACM TRANSACTIONS ON MATHEMATICAL SOFTWARE, 2008, 35 (02): : 1 - 13
  • [8] Semidefinite programming for discrete optimization and matrix completion problems
    Wolkowicz, H
    Anjos, MF
    DISCRETE APPLIED MATHEMATICS, 2002, 123 (1-3) : 513 - 577
  • [9] Interior point method and indefinite sparse solver for linear programming problems
    Runesha, H
    Nguyen, DT
    Belegundu, AD
    Chandrupatla, TR
    ADVANCES IN ENGINEERING SOFTWARE, 1998, 29 (3-6) : 409 - 414
  • [10] The application of linear programming technologies to the optimization of conflict problems
    Lo, Chih-Yao
    JOURNAL OF INFORMATION & OPTIMIZATION SCIENCES, 2005, 26 (03): : 693 - 713
12345