A heuristical solution method to separable nonlinear programming problems

DOI10.1504/IJMOR.2016.078002MaRDI QIDQ2204243zbMATH OpenFDO

Authors Kaj-Mikael Björk, József Mezei

Publication date 15 October 2020

Published in International Journal of Mathematics in Operational Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1504/IJMOR.2016.078002

zbMATH Keywords

heuristicsMILPMINLPmixed integer nonlinear programmingmixed integer programmingNLPnonlinear programmingoptimisation

Mathematics Subject Classification ID

Mixed integer programming (90C11) Nonlinear programming (90C30) Approximation methods and heuristics in mathematical programming (90C59)

Review text

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.

Recommendations

• Solving highly nonlinear convex separable programs using successive approximation
• scientific article; zbMATH DE number 1292040
• Heuristic algorithms for the general nonlinear separable knapsack problem
• scientific article; zbMATH DE number 713582
• A global optimization method for nonconvex separable programming problems

Cited in

(4)

• A heuristic algorithm for nonlinear programming
• One class of separable optimization problems: solution method, application
• scientific article; zbMATH DE number 3904344 (Why is no real title available?)
• scientific article; zbMATH DE number 4072722 (Why is no real title available?)

This page was built for publication: A heuristical solution method to separable nonlinear programming problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2204243)