Journal of the military operations research society of Korea (한국국방경영분석학회지)

Military Operations Research Society of Korea (한국국방경영분석학회)
권호 표지

A comparative study between various LU update methods in the simplex method

단체법에서 여러가지 상하 분해요소 수정방법들의 비교

  • Published : 2003.07.01
Download PDF
⟨ Previous Next ⟩

Abstract

The simplex method requires basis update in each iteration, which is the most time consuming process. Several methods have been developed for the update of basis which is represented in LU factorized form, such as Bartels-Golub's method, Forrest-Tomlin's method, Reid's method, Saunders's method, etc. In this research, we compare between the updating methods in terms of sparsity, data structure and computing time issues. The analysis is mainly based on the computational experience.

Keywords

References

  1. 박순달, '선형계획법(3정판)', 민영사, 1992
  2. 박순달, 'LPAKO ver 4.8 사용자 매뉴얼'. 2000
  3. 김우제, 안재근, 서용원, 성명기, 박순달, '단체법에서 기저행렬과 입력자료의 보관방법과 자료구조', 한국경영과학회/대한산업공학회 '95춘계 공동학술대회 논문집, 1995
  4. 박찬규, 임성묵, 김우제, 박순달, '상하분해를 이용한 단체법의 구현에 관한 연구', 대한산업공학회 '97추계학술대회 논문집
  5. Bartels, R. H., G. H. Golub, 'he Simplex method of linear programming using LU decomposition.' Communication of ACM, 12, pp. 266-268, 1969 https://doi.org/10.1145/362946.362974
  6. Bixby, R.E., 'Progress in Linear Programming', ORSA Journal on Computing, 6, pp. 15-22, 1994 https://doi.org/10.1287/ijoc.6.1.15
  7. Duff. I. S., A. M. Erisman, J. K. Reid, Direct Methods for Sparse Matrices, Clarendon Press, Oxford, 1986
  8. Forrest. J. J. H., J. A Tomlin, 'Updating triangular factors of the basis to maintain sparsity in the product-form simplex method.' Mathematical Programming, 2, pp 263-278, 1972 https://doi.org/10.1007/BF01584548
  9. Gay, D.M., 'Electronic mail distribution of linear programming test problems', Mathematical Programming Society Committee on Algorithms Newsletter, 13, 1985
  10. Karrrarkar, N. K, 'A new polynomiaI-Time Algonithm for Linear Programming', Combinatorica, 4, 4, pp. 373-395, 1984 https://doi.org/10.1007/BF02579150
  11. Lustig, I. J., R. E. Marsten and D. F. Shanno, 'Interior Point Methods for Linear Programming: Computational State of the Art', ORSA Journal on Computing, 6, 1, pp. 1-14, 1994 https://doi.org/10.1287/ijoc.6.1.1
  12. Megiddo, N., 'On finding primal- and dual-optimal bases', ORSA Journal on Computing, 3, 1, 1991 https://doi.org/10.1287/ijoc.3.1.63
  13. Reid J. K., 'A Sparsity-Exploiting Variant of the Bartels-Golub Decomposition for Linear Programming Bases', Computer Science and Systems Devision, A.E.R.E., Harwell, CSS20 pp 1-23, 1975 https://doi.org/10.1007/BF01585094
  14. Saunders, M. A., 'A fast, stable implementation of the Simplex method using Bartels-Golub updating', 1975
  15. Suhl, L. M., U. H. Suhl, 'A fast LU update for linear programming', Annals of Operations Research 43, pp.33-47, 1993 https://doi.org/10.1007/BF02025534
  16. Suhl U. H., L. M. Suhl, 'Computing Sparse LU Factorizations for Large-Scale Linear Programming Bases', ORSA Journal on Computing, 2, 4, 1990 https://doi.org/10.1287/ijoc.2.4.325
  17. Terlaky T., S. Zhang, 'Pivot rules for linear programming : A survey on recent theoretical developments', Annals of Operations Research 46, pp. 203-233, 1993 https://doi.org/10.1007/BF02096264