The pivot and probe algorithm for solving a linear program

@article{Sethi1984ThePA,
  title={The pivot and probe algorithm for solving a linear program},
  author={Awanti P. Sethi and Gerald L. Thompson},
  journal={Math. Program.},
  year={1984},
  volume={29},
  pages={219-233}
}
In [7] we defined a candidate constraint as one which, for at least one pivot step, contains a potential pivot, discovered that most constraints are never candidate, and devised a modification of the simplex method in which only constraints which are currently candidates are updated. In this paper we present another way to take advantage of this fact. We begin by solving a relaxed linear program consisting of the constraints at" the original problem which arc initially candidates. Its solution… CONTINUE READING

Figures, Tables, and Topics from this paper.

Similar Papers

Loading similar papers…