Variations on a cutting plane method for solving concave minimization problems with linear constraints
From MaRDI portal
Publication:4119020
DOI10.1002/nav.3800210206zbMath0348.90131OpenAlexW1963908413MaRDI QIDQ4119020
Publication date: 1974
Published in: Naval Research Logistics Quarterly (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/nav.3800210206
Numerical mathematical programming methods (65K05) Convex programming (90C25) Integer programming (90C10)
Related Items
An algorithm for optimizing over the weakly-efficient set, A branch and bound algorithm for extreme point mathematical programming problems, A composite branch and bound, cutting plane algorithm for concave minimization over a polyhedron, Using convex envelopes to solve the interactive fixed-charge linear programming problem, On the structure and properties of a linear multilevel programming problem, A finite procedure to generate feasible points for the extreme point mathematical programming problem, Nonconvex optimization over a polytope using generalized capacity improvement, A combined cutting-stock and lot-sizing problem, Linear multiplicative programming, A linear max—min problem, A relaxation algorithm for the minimization of a quasiconcave function on a convex polyhedron, On measuring the inefficiency with the inner-product norm in data envelopment analysis, An extreme-point-ranking algorithm for the extreme-point mathematical programming problem, Separable concave minimization via partial outer approximation and branch and bound, Bounding a class of nonconvex linearly-constrained resource allocation problems via the surrogate dual, Convergence of a subgradient method for computing the bound norm of matrices, On the convergence of cutting plane algorithms for a class of nonconvex mathematical programs, On the global minimization of concave functions
Cites Work
