Affine-Scaling Interior Point Method

Interior point methods have taken the world of linear optimization by storm. Explore the path taken by an affine-scaling interior point method (a variant of Karmarkar's original 1984 primal projection method) for a simple linear optimization problem, defined by constraints, objective function, and initial point.



  • [Snapshot]
  • [Snapshot]
  • [Snapshot]
  • [Snapshot]
  • [Snapshot]
  • [Snapshot]


The objective is to maximize subject to . Unlike for most interior point methods, it is NOT necessary for to be non-negative!
This Demonstration shows a variant of Karmarkar's original 1984 primal projection method. The Demonstration uses an affine-scaling method in which the scaled variables are the slack variables, therefore eliminating the need to scale the objective function.
The projection transformation is replaced with an affine transformation, and the potential function is replaced by the objective function. As is common for variations of Karmarkar's algorithm, in every iteration the search direction is the gradient of the projected objective function with respect to the scaled variables.
The parameter gamma is a "dampening factor" strictly between 0 and 1. For real-life problems a gamma close to 1, for example 0.99 or 0.95, is used. Higher gammas result in faster computations because fewer steps are needed, but they can result in overshooting for ill-conditioned problems.
For the problem to be properly defined, the initial point has to be inside the feasible area, the feasible area has to be weakly convex, and the objective function may not proceed along the two bordering faces towards infinity.
The algorithm, despite its simplicity, has beaten several commercial optimization algorithms on the large NETLIB test problems by several 100%. It is on par with several commercial network simplex algorithms for multi-commodity network problems. However, modern primal-dual methods, along with additional numerical techniques such as specialized algorithms for sparse matrices, efficient Cholesky decompositions, and parallel computing, will easily outperform this simple primal affine-scaling method by orders of magnitude.
    • Share:

Embed Interactive Demonstration New!

Just copy and paste this snippet of JavaScript code into your website or blog to put the live Demonstration on your site. More details »

Files require Wolfram CDF Player or Mathematica.

Mathematica »
The #1 tool for creating Demonstrations
and anything technical.
Wolfram|Alpha »
Explore anything with the first
computational knowledge engine.
MathWorld »
The web's most extensive
mathematics resource.
Course Assistant Apps »
An app for every course—
right in the palm of your hand.
Wolfram Blog »
Read our views on math,
science, and technology.
Computable Document Format »
The format that makes Demonstrations
(and any information) easy to share and
interact with.
STEM Initiative »
Programs & resources for
educators, schools & students.
Computerbasedmath.org »
Join the initiative for modernizing
math education.
Step-by-Step Solutions »
Walk through homework problems one step at a time, with hints to help along the way.
Wolfram Problem Generator »
Unlimited random practice problems and answers with built-in step-by-step solutions. Practice online or make a printable study sheet.
Wolfram Language »
Knowledge-based programming for everyone.
Powered by Wolfram Mathematica © 2017 Wolfram Demonstrations Project & Contributors  |  Terms of Use  |  Privacy Policy  |  RSS Give us your feedback
Note: To run this Demonstration you need Mathematica 7+ or the free Mathematica Player 7EX
Download or upgrade to Mathematica Player 7EX
I already have Mathematica Player or Mathematica 7+