Sufficient conditions for solving linearly constrained separable concave global minimization problems
From MaRDI portal
Recommendations
- A finite algorithm for globally minimizing a concave function under linear constraints and its applications
- Conical algorithm for the global minimization of linearly constrained decomposable concave minimization problems
- A finite algorithm for global minimization of separable concave programs
- scientific article; zbMATH DE number 3914093
- scientific article; zbMATH DE number 3913569
Cites work
- scientific article; zbMATH DE number 3272827 (Why is no real title available?)
- A parallel algorithm for constrained concave quadratic global minimization
- A parallel algorithm for partially separable non-convex global minimization: Linear constraints
- A parallel stochastic method for solving linearly constrained concave global minimization problems
Cited in
(5)- Computational comparison of two methods for constrained global optimization
- A quadratic assignment formulation of the molecular conformation problem
- A combined cutting-stock and lot-sizing problem
- Sufficient optimality criterion for linearly constrained, separable concave minimization problems
- scientific article; zbMATH DE number 3914093 (Why is no real title available?)
This page was built for publication: Sufficient conditions for solving linearly constrained separable concave global minimization problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1207045)