Azala

Towards a practical parallelisation of the simplex method

Gorde:
Argitaratua izan da:Computational Management Science vol. 7, no. 2 (Apr 2010), p. 139
Egile nagusia: Hall, J A; J
Argitaratua:
Springer Nature B.V.
Gaiak:
Linear programming
Studies
Parallel processing
Costs
Variables
Integer programming
Simplex method
Sarrera elektronikoa:Citation/Abstract
Full Text
Full Text - PDF
Etiketak: Etiketa erantsi
Etiketarik gabe, Izan zaitez lehena erregistro honi etiketa jartzen!
Laburpena: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
Baliabidea:ABI/INFORM Global