A heuristical solution method to separable nonlinear programming problems (Q2204243)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 7261363
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A heuristical solution method to separable nonlinear programming problems |
scientific article; zbMATH DE number 7261363 |
Statements
A heuristical solution method to separable nonlinear programming problems (English)
0 references
15 October 2020
0 references
Summary: 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.
0 references
MINLP
0 references
mixed integer nonlinear programming
0 references
MILP
0 references
mixed integer programming
0 references
nonlinear programming
0 references
NLP
0 references
optimisation
0 references
heuristics
0 references
0.7988871932029724
0 references
0.7796438336372375
0 references
0.7712931036949158
0 references
