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

Learn More →

A nonlinear programming test problem

A nonlinear programming test problem Figure 1 is a flow diagram of the chemical process. The test problem was a hydrocarbon refrigeration process in which the feed stream (stream number 1 of Figure 1) is a vapor mixture of ethane, propane, and n-butane (subscripts e, p and b, respectively) at 200°F and 500 psia. The product stream (stream number 8 of Figure 1) is liquid at -20°F at some reduced pressure. The nonlinear objective function was the minimization of the cost of the work done by the recycle stream compressors. There were 34 bounded variables (both upper bound and lower bound) associated with the process, 12 linear equality constraints, 18 nonlinear equality constraints, and 3 linear inequality constraints (see PROBLEM). The generalized reduced gradient code of Abadie and Guigou reached the solution shown in Table 1 from the nonfeasible starting point shown in Table 2. http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png ACM SIGMAP Bulletin Association for Computing Machinery

A nonlinear programming test problem

ACM SIGMAP Bulletin , Volume (27) – Jul 1, 1979

Loading next page...
 
/lp/association-for-computing-machinery/a-nonlinear-programming-test-problem-Gm60rNRgVQ
Publisher
Association for Computing Machinery
Copyright
Copyright © 1979 by ACM Inc.
ISSN
0163-5786
DOI
10.1145/1111246.1111249
Publisher site
See Article on Publisher Site

Abstract

Figure 1 is a flow diagram of the chemical process. The test problem was a hydrocarbon refrigeration process in which the feed stream (stream number 1 of Figure 1) is a vapor mixture of ethane, propane, and n-butane (subscripts e, p and b, respectively) at 200°F and 500 psia. The product stream (stream number 8 of Figure 1) is liquid at -20°F at some reduced pressure. The nonlinear objective function was the minimization of the cost of the work done by the recycle stream compressors. There were 34 bounded variables (both upper bound and lower bound) associated with the process, 12 linear equality constraints, 18 nonlinear equality constraints, and 3 linear inequality constraints (see PROBLEM). The generalized reduced gradient code of Abadie and Guigou reached the solution shown in Table 1 from the nonfeasible starting point shown in Table 2.

Journal

ACM SIGMAP BulletinAssociation for Computing Machinery

Published: Jul 1, 1979

There are no references for this article.