A global optimization algorithm (GOP) for certain classes of nonconvex NLPs-II. Application of theory and test problems

Computers and Chemical Engineering

Volumn 14, Issue 12, 1990, Pages 1419-1434

  Visweswaran, V ^a   Floudast, C A ^a  

^a PRINCETON UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

MATHEMATICAL PROGRAMMING;

GLOBAL OPTIMIZATION ALGORITHM (GOP); HARVEY'S POOLING PROBLEM; HESSE'S FUNCTIONS;

MATHEMATICAL TECHNIQUES;

EID: 0025596333     PISSN: 00981354     EISSN: None     Source Type: Journal    
DOI: 10.1016/0098-1354(90)80021-3     Document Type: Article

References (11)

1. A decomposition strategy for global optimum search in the pooling problem
2. Global optimum search for nonconvex NLP and MINLP problems
3. A collection of test problems for constrained global optimization algorithms
4. A global optimization algorithm (GOP) for certain classes of nonconvex NLPS—I. Theory
5. Studies of the behaviour of recursion for the pooling problem
6. Behaviour of recursion model—more studies
7. A heuristic search procedure for estimating a global solution of nonconvex programming problems
8. A cutting plane algorithm for solving bilinear programs
9. Solving the pooling problem using generalized reduced gradient and successive linear programming algorithms
10. An algorithm for separable nonconvex progranuning problems II nonconvex constraints
11. Globally minimizing polynomials without evaluating derivatives