On a class of functions attaining their maximum at the vertices of a polyhedron (Q1115347): Difference between revisions

The well known result that a convex function attains its maximum at a vertex of a polytope is extended here in some sense to functions which are convex on the edges of a polyhedron, or are m-convex. As an application the polynomial time solvability of a special combinatorial problem is proved.