Successive linear programming

From Wikipedia, the free encyclopedia

This is an old revision of this page, as edited by Marcocapelle (talk | contribs) at 10:02, 9 February 2018 (removed Category:Mathematical optimization; added Category:Optimization algorithms and methods using HotCat). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.

Successive Linear Programming (SLP), also known as Sequential Linear Programming, is an optimization technique for approximately solving nonlinear optimization problems.[1]

Starting at some estimate of the optimal solution, the method is based on solving a sequence of first-order approximations (i.e. linearizations) of the model. The linearizations are linear programming problems, which can be solved efficiently. As the linearizations need not be bounded, trust regions or similar techniques are needed to ensure convergence in theory. [2]

SLP has been used widely in the petrochemical industry since the 1970s. [3]

See also

References

  1. ^ (Nocedal & Wright 2006, p. 551)
  2. ^ (Bazaraa, Sheraly & Shetty 1993, p. 432)
  3. ^ (Palacios-Gomez et al.)

Sources

  • Nocedal, Jorge; Wright, Stephen J. (2006). Numerical Optimization (2nd ed.). Berlin, New York: Springer-Verlag. ISBN 978-0-387-30303-1. {{cite book}}: Invalid |ref=harv (help)
  • Bazaraa, Mokhtar S.; Sheraly, Hanif D.; Shetty, C.M. (1993). Nonlinear Programming, Theory and Applications (2nd ed.). John Wiley & Sons. ISBN 0-471-55793-5. {{cite book}}: Invalid |ref=harv (help)
  • Template:Cite article