Access the full text.
Sign up today, get DeepDyve free for 14 days.
Loading next page...
/lp/association-for-computing-machinery/solving-the-pooling-problem-using-generalized-reduced-gradient-and-u0FA6ZtTjX
References (11)
-
(1974)
Techniques and Experience Solving Really Big Non-Linear ProgrammesOptimization Methods for Resource Allocation -
R. Griffith, R. Stewart (1961)
A Nonlinear Programming Technique for the Optimization of Continuous Processing SystemsManagement Science, 7
-
L. Lasdon, A. Meeraus (1979)
Solving Nonlinear Economic Planning Models Using GRG Algorithms -
C. Haverly (1978)
Studies of the behavior of recursion for the pooling problem -
L. Lasdon, A. Waren (1978)
Generalized Reduced Gradient Software for Linearly and Nonlinearly Constrained Problems -
(978)
Behavior -Recursion Example Comments -
(1973)
The Harried Engineers Guide to Nonlinear Optimization -
L. Lasdon, A. Waren, A. Jain, Margery Ratner (1978)
Design and Testing of a Generalized Reduced Gradient Code for Nonlinear ProgrammingACM Trans. Math. Softw., 4
-
E. Beale (1978)
Nonlinear Programming Using a General Mathematical Programming System -
W. Hart (1978)
L. P. Behavior - recursion example comments -
C. Haverly (1979)
Behavior of recursion model - more studies
- Publisher
- Association for Computing Machinery
- Copyright
- Copyright © 1979 by ACM Inc.
- ISSN
- 0163-5786
- DOI
- 10.1145/1111246.1111247
- Publisher site
- See Article on Publisher Site
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.
Journal
ACM SIGMAP Bulletin – Association for Computing Machinery
Published: Jul 1, 1979