• Home
  • Search
  • An Improved Successive Linear Programming Algorithm
  • Cite Icon122
  • https://doi.org/10.1287/mnsc.31.10.1312Copy DOI Icon

An Improved Successive Linear Programming Algorithm

Show More
  • Abstract
  • Literature Map
  • References
  • Citations
  • Similar Papers
Abstract

Successive Linear Programming (SLP) algorithms solve nonlinear optimization problems via a sequence of linear programs. They have been widely used, particularly in the oil and chemical industries, beginning with their introduction by Griffith and Stewart of Shell Development Company in 1961. Since then, several applications and variants of SLP have appeared, the most recent being the SLPR algorithm described in this journal in 1982 (Palacios-Gomez et al.). SLP procedures are attractive because they are fairly easy to implement if an efficient, flexible LP code is available, can solve nonseparable as well as separable problems, can be applied to as large a problem as the LP code can handle (often thousands of constraints and variables), and have been successful in many practical applications. This paper describes a new SLP algorithm called PSLP (Penalty SLP). PSLP represents a significant strengthening and refinement of the SLPR procedure described in Palacios-Gomez et al. (Palacios-Gomez, F., L. Lasdon, M. Engquist. 1982. Nonlinear optimization by successive linear programming. Management Sci. 28 1106–1120.). We give a convergence proof for PSLP—the first SLP convergence proof for nonlinearly constrained problems of general form. This theory is supported by computational performance—in our tests, PSLP is significantly more robust than SLPR, and at least as efficient. A Fortran computer implementation is described. A simplified version of PSLP has already solved several “real world” NLP problems at Exxon (Baker and Lasdon [Baker, T. E., L. S. Lasdon. 1985. Successive linear programming at Exxon. Management Sci. 31 (March) 264–274.), including nonlinear refinery models of up to 1000 rows. As with other SLP algorithms, PSLP is especially efficient on problems which are highly constrained, i.e., which have nearly as many active constraints as there are variables. For problems with vertex optima (at least as many active constraints as variables), it is quadratically convergent. Nonlinear refinery models often have vertex optima, since they are large and mostly linear, and on line process unit optimization problems are likely to possess highly constrained solutions as well. PSLP has great potential for accurate, efficient solution of such problems.

Similar Papers
  • Research Article
  • Citations39

General skew constrained clock network sizing based on sequential linear programming

  • May 01, 2005
  • IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
  • Kai Wang +3
  • Research Article
  • Citations27

Tuning successive linear programming to solve AC optimal power flow problem for large networks

  • Dec 20, 2021
  • International Journal of Electrical Power & Energy Systems
  • Sayed Abdullah Sadat +1
  • Research Article
  • Citations11

Linear Optimization Based Distribution Grid Flexibility Aggregation Augmented With OLTC Operational Flexibilities

  • Jan 01, 2022
  • IEEE Access
  • Neelotpal Majumdar +3
  • Research Article

Systems Theory for the civil engineer Comparison of algorithms for hydropower optimization: Manitoba Hydro case study

  • Mar 01, 1991
  • Civil Engineering Systems
  • Karolj K Reznicek +3
  • Conference Article
  • Citations22

Evaluation of Various Techniques to Warm-Start a Successive Linear Programming Algorithm for Solving the IV ACOPF

  • Aug 01, 2018
  • Sayed Abdullah Sadat +2
  • Research Article
  • Citations11

A Note on the Convergence of Analytical Target Cascading With Infinite Norms

  • Mar 01, 2010
  • Journal of Mechanical Design
  • Jeongwoo Han +1
  • Research Article
  • Citations47

Move limits definition in structural optimization with sequential linear programming. Part II: Numerical examples

  • Jan 24, 2003
  • Computers & Structures
  • Luciano Lamberti +1
  • Research Article
  • Citations6

$\mathcal{l}_{1}$ Filtering for Positive Takagi–Sugeno Fuzzy Systems via Successive Linear Programming

  • Jun 01, 2023
  • IEEE Transactions on Fuzzy Systems
  • Yingying Ren +2
  • Research Article
  • Citations32

Market-based congestion management in electric power systems with increased share of natural gas dependent power plants

  • May 11, 2011
  • Energy
  • Miloš Pantoš
  • Dissertation

An Evaluation of the Applicability of Nonlinear Programming Algorithms to a Typical Commercial Process Flowsheeting Simulator. (Volumes I and II).

  • Jan 01, 1987
  • Michael Richard
  • Conference Article
  • Citations10

Handling state dependent nonlinear tunnel flows in short-term hydropower scheduling

  • Nov 21, 2004
  • M.M Belsnes +2
  • Research Article
  • Citations13

Fuzzy Heuristics for Sequential Linear Programming

  • Mar 01, 1998
  • Journal of Mechanical Design
  • E L Mulkay +1
  • PDF
  • Research Article
  • Citations3

On the effectiveness of sequential linear programming for the pooling problem

  • Jan 19, 2023
  • Annals of Operations Research
  • Andreas Grothey +1
  • Conference Article

Optimal power flow algorithm based on self-adaptive filter-trust region method

  • Sep 01, 2017
  • Penghui Zhao +3
  • Conference Article
  • Citations4

Efficient booster pump placement in water networks using graph theoretic principles

  • Jun 01, 2012
  • I Narayanan +6
Cactus Communications logo

Copyright 2026 Cactus Communications. All rights reserved.