Correction to: Linear Programming Using MATLAB®

Abstract

Linear Programming (LP) is a significant area in the field of operations research. The simplex algorithm is one of the top ten algorithms with the greatest influence in the twentieth century and the most widely used method for solving linear programming problems (LPs). Since the introduction of the simplex algorithm in 1947,LP has been widely used in many practical problems. However, the size of practical LPs grew up significantly. Consequently, the simplex algorithm began to encounter computational issues in the solution of large LPs. A variety of methods have been proposed to strengthen the computational performance of simplex algorithm. Furthermore, new algorithms have been proposed to solve LPs, like the dual simplex algorithm, interior point methods, and exterior point simplex algorithms. The main feature of this book is the presentation of a variety of LP algorithms and methods and especially the revised simplex method and its components. The computational performance of simplex algorithm on practical problems is usually far better than the theoretical worst case. This book includes the thorough theoretical and computational presentation of four LP algorithms: • the revised primal simplex algorithm, • the revised dual simplex algorithm, • the exterior point simplex algorithm, and • Mehrotra’s interior point method.