A cutting plane method for minimizing pseudo-convex functions in the mixed integer case

Computers and Chemical Engineering

Volumn 24, Issue 12, 2000, Pages 2655-2665

  Pörn, Ray ^a   Westerlund, Tapio ^a  

^a ÅBO AKADEMI UNIVERSITY   (Finland)

Author keywords

Cutting plane method; Mixed integer non linear programming; Pseudo convex functions

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; CONSTRAINT THEORY; FUNCTIONS; ITERATIVE METHODS; NONLINEAR PROGRAMMING;

CUTTING PLANE METHOD; MIXED INTEGER NONLINEAR PROGRAMMING (MINLP); PSEUDOCONVEX FUNCTIONS;

CHEMICAL ENGINEERING;

ARTICLE; COMPUTER PROGRAM; INTERMETHOD COMPARISON; MATHEMATICAL ANALYSIS; NONLINEAR SYSTEM; PROBLEM SOLVING; STATISTICAL ANALYSIS;

EID: 0034405697     PISSN: 00981354     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0098-1354(00)00622-0     Document Type: Article

References (21)

1. A global optimization method, (BB, for process design
2. Global optimization of MINLP problems in process synthesis and design
3. An outer-approximation algorithm for a class of mixed-integer nonlinear programs
4. Solving mixed-integer nonlinear programs by outer approximation
5. Generalized benders decomposition
6. Different transformations for solving non-convex trim loss problems by MINLP
7. Cyclic scheduling of continuous parallel-process units with decaying performance
8. An LP/NLP based branch-and-bound algorithm for convex MINLP optimization problems
9. Global optimization of non-convex NLPs and MINLPs with applications in process design
10. Comparison of solving non-convex NLP and MINLP problems with applications in process design
11. Global optimization of nonconvex MINLPs'
12. The extended cutting plane algorithm
13. A combined penalty function and outer approximation method for MINLP optimization
14. New formulations and branching strategies for the GOA algorithm
15. An extended cutting plane method for solving convex MINLP problems
16. Optimization of pump configurations as a MINLP problem
17. An extended cutting plane method for a class of non-convex MINLP problems
18. Experiments in process synthesis via mixed-integer programming