Exploring Interior-Point Linear Programming

Linear programming is widely used in industry to solve complex planning and resource allocation problems. This book provides practitioners, as well as students of this general methodology, with an introduction to the class of algorithms known as interior-point methods for linear programming. In addition to presenting the theoretical and algorithmic background necessary for dealing with specific interior-point linear programming algorithms, it offers a review of modelling linear programming problems, a review of the simplex algorithm that has been used to solve linear programming problems in the past and a user's guide to the software that is included with the book.