Successive linear programming
From Wikipedia, the free encyclopedia
 |
This article may require cleanup to meet Wikipedia's quality standards. Please discuss this issue on the talk page or replace this tag with a more specific message. This article has been tagged since January 2007. |
SLP - Successive Linear Programming
It is relatively easy to make a linear approximation to a nonlinear objective function and any nonlinear constraints, starting at some estimate of the optimal solution. This produces a linear program, which is solved to get an optimum and corresponding values of the variables.
A new linear approximation can now be made, and solved, and then the process repeated. The approach is thus similar conceptually to equation solving procedures which use linear approximations.
Unfortunately, because a linear program always finds its optimum on a constraint, if the optimum for the NLP is not in fact constrained, this method will not find it! Although it has some disadvantages, SLP may be an effective method if the optimum is known to lie on a constraint. There are even ways of making it work when the optimum is unconstrained, but this uses a concept known as a `trust region' and is not a commonly available technique.
SLP is not much used for process engineering problems, SQP, described below, is more usual.
