Abstract
There are many methods for the solution of nonlinear programming (NLP) problems. This paper presents a new method, a heuristic, for the solution of large-scale separable NLP-problems. In this paper, separable NLP-problems are referred to a problem structure where each variable, in the problem, is only found in terms with a single variable. The method can tackle separable MINLP-problems as well. The proposed method is used to solve some smaller examples in order to show the usefulness of it on real problems.
| Original language | English |
|---|---|
| Peer-reviewed scientific journal | International Journal of Mathematics in Operational Research |
| Volume | 9 |
| Issue number | 2 |
| Pages (from-to) | 230-242 |
| Number of pages | 13 |
| ISSN | 1757-5850 |
| DOIs | |
| Publication status | Published - 26.07.2016 |
| MoE publication type | A1 Journal article - refereed |
Keywords
- 512 Business and Management
- MINLP
- mixed integer nonlinear programming
- MILP
- mixed integer programming
- nonlinear programming
- NLP
- optimisation
- heuristics