A heuristical solution method to separable nonlinear programming problems

Kaj Mikael Björk*, József Mezei

*Motsvarande författare för detta arbete

Forskningsoutput: TidskriftsbidragArtikelVetenskapligPeer review

2 Citeringar (Scopus)

Sammanfattning

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.

OriginalspråkEngelska
Referentgranskad vetenskaplig tidskriftInternational Journal of Mathematics in Operational Research
Volym9
Utgåva2
Sidor (från-till)230-242
Antal sidor13
ISSN1757-5850
DOI
StatusPublicerad - 26.07.2016
MoE-publikationstypA1 Originalartikel i en vetenskaplig tidskrift

Nyckelord

  • 512 Företagsekonomi

Fingeravtryck Fördjupa i forskningsämnen för ”A heuristical solution method to separable nonlinear programming problems”. Tillsammans bildar de ett unikt fingeravtryck.

Citera det här