Data Structures and Algorithms


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

Authors: Kurt Mehlhorn, Sanjeev Saxena

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.

Comments: 18 Pages.

Download: PDF

Submission history

[v1] 2015-10-29 03:15:36
[v2] 2016-06-15 06:17:06

Unique-IP document downloads: 82 times is a pre-print repository rather than a journal. Articles hosted may not yet have been verified by peer-review and should be treated as preliminary. In particular, anything that appears to include financial or legal advice or proposed medical treatments should be treated with due caution. will not be responsible for any consequences of actions that result from any form of use of any documents on this website.

Add your own feedback and questions here:
You are equally welcome to be positive or negative about any paper but please be polite. If you are being critical you must mention at least one specific error, otherwise your comment will be deleted as unhelpful.

comments powered by Disqus