# 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.

#### 4 Citations

A minimax probability extreme machine framework and its application in pattern recognition

- Computer Science
- Eng. Appl. Artif. Intell.
- 2019

#### References

SHOWING 1-10 OF 21 REFERENCES

Introducing Interior-Point Methods for Introductory Operations Research Courses and/or Linear Programming Courses

- Computer Science
- 2009

On the Convergence of a Class of Infeasible Interior-Point Methods for the Horizontal Linear Complementarity Problem

- Mathematics, Computer Science
- SIAM J. Optim.
- 1994

The use of the optimal partition in a linear programming solution for postoptimal analysis

- Mathematics, Computer Science
- Oper. Res. Lett.
- 1994

Infeasible-Interior-Point Primal-Dual Potential-Reduction Algorithms for Linear Programming

- Mathematics, Computer Science
- SIAM J. Optim.
- 1995

Linear Programming: Foundations and Extensions

- Computer Science
- Kluwer international series in operations research and management service
- 1998