Abstract
An extended cutting plane method is introduced. The extended method can be applied in the solution of a class of non-convex MINLP (mixed-integer non-linear programming) problems, although the method was originally introduced for the solution of convex problems only. Global convergence properties of the method are given for pseudo-convex MINLP problems in the present paper and a numerical example from the paper-converting industry is finally provided to illustrate the numerical procedure.
| Original language | English |
|---|---|
| Pages (from-to) | 357-365 |
| Number of pages | 9 |
| Journal | Computers and Chemical Engineering |
| Volume | 22 |
| Issue number | 3 |
| Publication status | Published - 1998 |
| MoE publication type | A1 Journal article-refereed |
Keywords
- Extended cutting plane method
- Integer non-linear programming
- Mixed-integer non-linear programming
- Optimization
- Pseudo-convex functions
- Quasi-convex functions