- 156 Downloads
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.
Unable to display preview. Download preview PDF.