Abstract
Within the last decade, there have been major advances in the ability to solve large scale linear programs. These have been primarily fueled by the fundamental work, in 1984, of Narinder K. Karmarkar, which has had considerable impact on the algorithms for solving the linear programming problems. A new class of algorithms, known as the interior point methods, have been generated. These algorithms proceed through the interior of the feasible region towards the boundary solution, and generate a converging sequence of points in the interior. The prior algorithms searched on the boundary of the feasible region, and found the solution in a finite number of steps. These boundary algorithms are variants of the simplex method discovered by George B. Dantzig in 1947.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1995 Springer Science+Business Media New York
About this chapter
Cite this chapter
Saigal, R. (1995). Boundary Methods. In: Linear Programming. International Series in Operations Research & Management Science, vol 1. Springer, Boston, MA. https://doi.org/10.1007/978-1-4615-2311-6_4
Download citation
DOI: https://doi.org/10.1007/978-1-4615-2311-6_4
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4613-5977-7
Online ISBN: 978-1-4615-2311-6
eBook Packages: Springer Book Archive