On a class of functions attaining their maximum at the vertices of a polyhedron

AbstractWe present some conditions, weaker than convexity, guaranteeing that the set of global maximum points of a function over a polyhedron P is a union of faces of P. These results are then applied to prove polynomial-time solvability for some problems