Greedy systems of linear inequalities and lexicographically optimal solutions

The present note reveals the role of the concept of greedy system of linear inequalities played in connection with lexicographically optimal solutions on convex polyhedra and discrete convexity. The lexicographically optimal solutions on convex polyhedra represented by a greedy system of linear inequalities can be obtained by a greedy procedure, a special form of which is the greedy algorithm of J. Edmonds for polymatroids. We also examine when the lexicographically optimal solutions become integral. By means of the Fourier–Motzkin elimination Murota and Tamura have recently shown the existence of integral points in a polyhedron arising as a subdifferential of an integer-valued, integrally convex function due to Favati and Tardella [Murota and Tamura, Integrality of subgradients and biconjugates of integrally convex functions. Preprint arXiv:1806.00992v