Concave Minimization Via Collapsing Polytopes

DOI10.1287/opre.34.6.919zbMath0632.90057OpenAlexW2111671783MaRDI QIDQ3770289

James E. Falk, Karla L. Hoffman

Publication date: 1986

Published in: Operations Research (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/ea7bfd4f0394cc0a0bbd46de564e1e856e246250

zbMATH Keywords

linear inequalitiesconcave function on a polytope

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Numerical methods based on nonlinear programming (49M37)

Related Items

A composite branch and bound, cutting plane algorithm for concave minimization over a polyhedron, Nonconvex optimization over a polytope using generalized capacity improvement, On a class of functions attaining their maximum at the vertices of a polyhedron, Improved convex and concave relaxations of composite bilinear forms, On the minimization of a quasi-concave function subject to linear constraints, On-line and off-line vertex enumeration by adjacency lists, Construction of large-scale global minimum concave quadratic test problems, A note on adapting methods for continuous global optimization to the discrete case, An explicit characterization of the convex envelope of a bivariate bilinear function over special polytopes, Separable concave minimization via partial outer approximation and branch and bound, Extremist vs. centrist decision behavior: Quasi-convex utility functions for interactive multi-objective linear programming problems