Concave Minimization Via Collapsing Polytopes

DOI10.1287/OPRE.34.6.919MaRDI QIDQ3770289zbMATH OpenOpenAlexFDO

Authors 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

concave function on a polytopelinear inequalities

Mathematics Subject Classification ID

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

Recommendations

• Minimizing Piecewise-Concave Functions Over Polyhedra
• Concave minimization via conical partitions and polyhedral outer approximation
• scientific article; zbMATH DE number 4037615
• A finite algorithm for concave minimization over a polyhedron
• Concave programming for minimizing the zero-norm over polyhedral sets
• On Convex Minimization over Base Polytopes
• On minimization subject to cone constraints
• scientific article; zbMATH DE number 757675
• Normal conical algorithm for concave minimization over polytopes
• Solving polyhedral d.c. optimization problems via concave minimization

Cited in

(14)

• On a class of functions attaining their maximum at the vertices of a polyhedron
• On the minimization of a quasi-concave function subject to linear constraints
• On-line and off-line vertex enumeration by adjacency lists
• A composite branch and bound, cutting plane algorithm for concave minimization over a polyhedron
• Extremist vs. centrist decision behavior: Quasi-convex utility functions for interactive multi-objective linear programming problems
• Nonconvex optimization over a polytope using generalized capacity improvement
• 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
• Improved convex and concave relaxations of composite bilinear forms
• Minimizing Piecewise-Concave Functions Over Polyhedra
• scientific article; zbMATH DE number 4187464 (Why is no real title available?)
• Reverse polyblock approximation for optimization over the weakly efficient set and efficient set.

This page was built for publication: Concave Minimization Via Collapsing Polytopes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3770289)