Skip to main content
Article thumbnail
Location of Repository

Restricted vertex generation applied as a CRASHing procedure for linear programming

By H. Paul Williams


The dual of Fourier-Motzkin elimination is described and illustrated by a numerical example. It is pointed out that the method can generate an enormous number of columns rendering it impractical. If carried to completion all extreme solutions of the original model are generated. By restricting the generation of columns, only some of the extreme solutions will be produced. The best such feasible basis generated in this way can be used as a starting basis for the simplex algorithm. Therefore this restricted method can be regarded as a CRASHing procedure. Ways in which the method might be adapted for improved computational efficiency are suggested

Topics: QA Mathematics, QA75 Electronic computers. Computer science
Publisher: Elsevier
Year: 1984
DOI identifier: 10.1016/0305-0548(84)90041-8
OAI identifier:
Provided by: LSE Research Online
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • (external link)
  • (external link)
  • Suggested articles

    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.