Interior Point Methods

  • Michael J. Panik
Part of the Applied Optimization book series (APOP, volume 2)


It was mentioned earlier that the standard simplex method searches for an optimum to a linear program by moving along the surface of a convex polyhedron from one extreme point to an adjacent extreme point in a fashion such that the objective value is nondecreasing between successive basic feasible solutions. The simplex process then either terminates, in a finite number of steps, at a finite optimal solution or reveals that no such solution exists. In this chapter we shall examine a set of interior point methods for solving a linear program (e.g., projective and affine potential reduction, primal and dual affine scaling, and path following), so named because they converge to an optimal point (if one exists) by passing through the interior of a convex polytope in a fashion such that, at each iteration, a weighted least squares problem is solved.


Interior Point Method Central Path Projective Transformation Steep Descent Direction Dual Feasible Solution 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Kluwer Academic Publishers 1996

Authors and Affiliations

  • Michael J. Panik
    • 1
  1. 1.University of HartfordUSA

Personalised recommendations