Solving the pooling problem using generalized reduced gradient and successive linear programming algorithms
- 1 July 1979
- journal article
- Published by Association for Computing Machinery (ACM) in ACM SIGMAP Bulletin
- No. 27,p. 9-15
- https://doi.org/10.1145/1111246.1111247
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.Keywords
This publication has 5 references indexed in Scilit:
- Behavior of recursion model - more studiesACM SIGMAP Bulletin, 1979
- Studies of the behavior of recursion for the pooling problemACM SIGMAP Bulletin, 1978
- L. P. Behavior - recursion example commentsACM SIGMAP Bulletin, 1978
- Design and Testing of a Generalized Reduced Gradient Code for Nonlinear ProgrammingACM Transactions on Mathematical Software, 1978
- A Nonlinear Programming Technique for the Optimization of Continuous Processing SystemsManagement Science, 1961