English
 
User Manual Privacy Policy Disclaimer Contact us
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT

Released

Paper

A Still Simpler Way of Introducing the Interior-Point Method for Linear Programming

MPS-Authors
/persons/resource/persons45021

Mehlhorn,  Kurt
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

Locator
There are no locators available
Fulltext (public)

arXiv:1510.03339.pdf
(Preprint), 190KB

Supplementary Material (public)
There is no public supplementary material available
Citation

Mehlhorn, K., & Saxena, S. (2015). A Still Simpler Way of Introducing the Interior-Point Method for Linear Programming. Retrieved from http://arxiv.org/abs/1510.03339.


Cite as: http://hdl.handle.net/11858/00-001M-0000-0028-F70B-6
Abstract
Linear programming is now included in algorithm undergraduate and postgraduate courses for computer science majors. We show that it is possible to teach interior-point methods directly to students with just minimal knowledge of linear algebra.