Concave minimization over a convex polyhedron

From MaRDI portal
Publication:4773515

DOI10.1002/nav.3800200313zbMath0286.90052OpenAlexW2064973050MaRDI QIDQ4773515

Hamdy A. Taha

Publication date: 1973

Published in: Naval Research Logistics Quarterly (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/nav.3800200313



Related Items

An algorithm for optimizing over the weakly-efficient set, A composite branch and bound, cutting plane algorithm for concave minimization over a polyhedron, A Lagrangian heuristic for concave cost facility location problems: the plant location and technology acquisition problem, Using convex envelopes to solve the interactive fixed-charge linear programming problem, Extreme point Quadratic Minimization Problem, An algorithm for solving fixed-charge problems using surrogate constraints, Enumerative techniques for solving some nonconvex global optimization problems, A general purpose exact solution method for mixed integer concave minimization problems, Calculation of bounds on variables satisfying nonlinear inequality constraints, A relaxation algorithm for the minimization of a quasiconcave function on a convex polyhedron, Using shortest paths in some transshipment problems with concave costs, Minimum concave-cost network flow problems: Applications, complexity, and algorithms, COAL: A new heuristic approach for solving the fixed charge problem - computational results, Separable concave minimization via partial outer approximation and branch and bound, Maximization of linearly constrained posynomials, Concave cost minimization on networks, Bounding a class of nonconvex linearly-constrained resource allocation problems via the surrogate dual, A computational study of using preprocessing and stronger formulations to solve large general fixed charge problems, Convergence of a subgradient method for computing the bound norm of matrices, On the global minimization of concave functions, Quasiconjugates of functions, duality relationship between quasiconvex minimization under a reverse convex constraint and quasiconvex maximization under a convex constraint, and applications