A still simpler way of introducing interior-point method for linear programming

@article{Mehlhorn2016ASS,
  title={A still simpler way of introducing interior-point method for linear programming},
  author={K. Mehlhorn and S. Saxena},
  journal={ArXiv},
  year={2016},
  volume={abs/1412.0652}
}
Linear programming is now included in algorithm undergraduate and postgraduate courses for computer science majors. We give a self-contained treatment of an interior-point method which is particularly tailored to the typical mathematical background of CS students. In particular, only limited knowledge of linear algebra and calculus is assumed. 

References

SHOWING 1-10 OF 21 REFERENCES
On the Convergence of a Class of Infeasible Interior-Point Methods for the Horizontal Linear Complementarity Problem
  • Yin Zhang
  • Mathematics, Computer Science
  • SIAM J. Optim.
  • 1994
An Easy Way to Teach Interior Point Methods
Infeasible-Interior-Point Primal-Dual Potential-Reduction Algorithms for Linear Programming
Linear Programming: Foundations and Extensions
  • R. Vanderbei
  • Computer Science
  • Kluwer international series in operations research and management service
  • 1998
Interior Point Methods For Linear Optimization
Linear Programming
  • Y. Rabani
  • Computer Science
  • Handbook of Approximation Algorithms and Metaheuristics
  • 2007
Introduction to linear optimization
...
1
2
3
...