A heuristical solution method to separable nonlinear programming problems

Kaj-Mikael Björk and József Mezei

International Journal of Mathematics in Operational Research, 2016, vol. 9, issue 2, 230-242

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.

Keywords: MINLP; mixed integer nonlinear programming; MILP; mixed integer programming; nonlinear programming; NLP; optimisation; heuristics. (search for similar items in EconPapers)
Date: 2016
References: Add references at CitEc
Citations:

Downloads: (external link)
http://www.inderscience.com/link.php?id=78002 (text/html)
Access to full text is restricted to subscribers.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:ids:ijmore:v:9:y:2016:i:2:p:230-242

Access Statistics for this article

More articles in International Journal of Mathematics in Operational Research from Inderscience Enterprises Ltd
Bibliographic data for series maintained by Sarah Parker ().