Towards a practical parallelisation of the simplex method
保存先:
| 出版年: | Computational Management Science vol. 7, no. 2 (Apr 2010), p. 139 |
|---|---|
| 第一著者: | |
| 出版事項: |
Springer Nature B.V.
|
| 主題: | |
| オンライン･アクセス: | Citation/Abstract Full Text Full Text - PDF |
| タグ: |
タグなし, このレコードへの初めてのタグを付けませんか!
|
| 抄録: | The simplex method is frequently the most efficient method of solving linear programming (LP) problems. This paper reviews previous attempts to parallelise the simplex method in relation to efficient serial simplex techniques and the nature of practical LP problems. For the major challenge of solving general large sparse LP problems, there has been no parallelisation of the simplex method that offers significantly improved performance over a good serial implementation. However, there has been some success in developing parallel solvers for LPs that are dense or have particular structural properties. As an outcome of the review, this paper identifies scope for future work towards the goal of developing parallel implementations of the simplex method that are of practical value. [PUBLICATION ABSTRACT] |
|---|---|
| ISSN: | 1619-697X 1619-6988 |
| DOI: | 10.1007/s10287-008-0080-5 |
| ソース: | ABI/INFORM Global |