Get 20M+ Full-Text Papers For Less Than $1.50/day. Start a 14-Day Trial for You or Your Team.

Learn More →

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

Solving the pooling problem using generalized reduced gradient and successive linear programming... 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. http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png ACM SIGMAP Bulletin Association for Computing Machinery

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

Loading next page...
 
/lp/association-for-computing-machinery/solving-the-pooling-problem-using-generalized-reduced-gradient-and-u0FA6ZtTjX
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 BulletinAssociation for Computing Machinery

Published: Jul 1, 1979

There are no references for this article.