IMPLEMENTING THE SIMPLEX-METHOD FOR THE OPTIMIZATION SUBROUTINE LIBRARY

被引:17
作者
FORREST, JJH [1 ]
TOMLIN, JA [1 ]
机构
[1] IBM CORP,DIV RES,ALMADEN RES CTR,SAN JOSE,CA 95120
关键词
D O I
10.1147/sj.311.0011
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
In this paper we describe the simplex algorithm and briefly discuss the interaction of the detailed implementation of the algorithm with the changes in computer hardware over the last 30 years. Then we give one example of the design changes needed to implement the method efficiently for the IBM 3090TM vector architecture. For the later RISC System/6000TM implementation, it was necessary to rethink this yet again. Finally we discuss the issue of robustness and the steps that were taken to give maximum reliability in the simplex algorithm in the IBM Optimization Subroutine Library.
引用
收藏
页码:11 / 25
页数:15
相关论文
共 24 条
  • [1] [Anonymous], MODEL BUILDING MATH
  • [2] SIMPLEX METHOD OF LINEAR PROGRAMMING USING LU DECOMPOSITION
    BARTELS, RH
    GOLUB, GH
    [J]. COMMUNICATIONS OF THE ACM, 1969, 12 (05) : 266 - &
  • [3] Beale EM, 1968, MATH PROGRAMMING PRA
  • [4] BEALE EML, 1985, J OPER RES SOC, V36, P357
  • [5] EFFICIENT SOLUTION OF LARGE-SCALE LINEAR-PROGRAMMING PROBLEMS - SOME ALGORITHMIC TECHNIQUES AND COMPUTATIONAL RESULTS
    BENICHOU, M
    GAUTHIER, JM
    HENTGES, G
    RIBIERE, G
    [J]. MATHEMATICAL PROGRAMMING, 1977, 13 (03) : 280 - 322
  • [6] Dantzig G.B., 2003, LINEAR PROGRAMMING T, V2
  • [7] ELDERVELD SK, 1990, IN PRESS SIAM J MATR
  • [8] Forrest J. J. H., 1990, Annals of Operations Research, V22, P71, DOI 10.1007/BF02023049
  • [9] Forrest J. J. H., 1972, MATH PROGRAM, V2, P263
  • [10] A PRACTICAL ANTICYCLING PROCEDURE FOR LINEARLY CONSTRAINED OPTIMIZATION
    GILL, PE
    MURRAY, W
    SAUNDERS, MA
    WRIGHT, MH
    [J]. MATHEMATICAL PROGRAMMING, 1989, 45 (03) : 437 - 474