Solving the pooling problem using generalized reduced gradient and successive linear programming algorithms

Abstract

In earlier issues of this bulletin, Haverly and Hart discussed solving some simple pooling problems using LP recursion [1]-[3]. We thought it would be interesting to attempt to solve these problems using some nonlinear programming (NLP) codes. This note briefly discusses the codes and algorithms used, presents the results, and discusses some properties of the models.