Sufficient conditions for solving linearly constrained separable concave global minimization problems

DOI10.1007/BF01100241zbMath0778.90066OpenAlexW2090139406MaRDI QIDQ1207045

A. T. Phillips, J. Ben Rosen

Publication date: 4 May 1993

Published in: Journal of Global Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01100241

zbMATH Keywords

polytopesufficient conditionsglobal minimizationconcave function

Mathematics Subject Classification ID

Nonlinear programming (90C30) Computational methods for problems pertaining to operations research and mathematical programming (90-08)

Related Items (4)

Computational comparison of two methods for constrained global optimization ⋮ A combined cutting-stock and lot-sizing problem ⋮ Sufficient optimality criterion for linearly constrained, separable concave minimization problems ⋮ A quadratic assignment formulation of the molecular conformation problem

Cites Work

• A parallel algorithm for constrained concave quadratic global minimization
• A parallel stochastic method for solving linearly constrained concave global minimization problems
• A parallel algorithm for partially separable non-convex global minimization: Linear constraints
• Unnamed Item

This page was built for publication: Sufficient conditions for solving linearly constrained separable concave global minimization problems