An optimization problem with a separable non-convex objective function and a linear constraint

DOI10.1023/A:1009661804163MaRDI QIDQ5937020zbMATH OpenOpenAlexFDO

Authors Djangir A. Babayev, George I. Bell

Publication date 2001

Published in Journal of Heuristics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1023/a:1009661804163

zbMATH Keywords

concave relaxationheuristic algorithmoptimality conditionsupper bound

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26) Approximation methods and heuristics in mathematical programming (90C59)

Recommendations

• scientific article; zbMATH DE number 970360
• Algorithms for separable nonlinear resource allocation problems
• An algorithm for separable nonlinear minimax problems
• Global optimization of separable objective functions on convex polyhedra via piecewise-linear approximation
• Efficient resource allocation with non-concave objective functions

Cited in

(1)

• scientific article; zbMATH DE number 970360 (Why is no real title available?)

This page was built for publication: An optimization problem with a separable non-convex objective function and a linear constraint

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