Proximate linear programming: An experimental study of a modified simplex algorithm for solving linear programs with inexact data

@inproceedings{Gould1971ProximateLP,
  title={Proximate linear programming: An experimental study of a modified simplex algorithm for solving linear programs with inexact data},
  author={Floyd J. Gould},
  year={1971}
}
Abstract : A modified simplex method has been developed for attacking large linear programs with inexact data in the right hand sides. Results from performing a limited series of computational experiments are reported. These results indicate reductions in computer time of 30 to 70 per cent over the ordinary simplex method. 

Citations

Publications citing this paper.