A Still Simpler Way of Introducing the Interior-Point Method for Linear Programming
Data Structures and Algorithms
2016-12-07 v2 Optimization and Control
Abstract
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.
Cite
@article{arxiv.1510.03339,
title = {A Still Simpler Way of Introducing the Interior-Point Method for Linear Programming},
author = {Kurt Mehlhorn and Sanjeev Saxena},
journal= {arXiv preprint arXiv:1510.03339},
year = {2016}
}
Comments
Updates and replaces arXiv:1412.0652