Note on pseudolattices, lattices and submodular linear programs

Authors:
Ulrich Faigle;Britta Peis
Affiliations:
Mathematisches Institut/ZAIK, Universität zu Köln, Weyertal 80, D-50931 Köln, Germany and Universität Dortmund, Fachbereich Mathematik, Vogelpothsweg 87, D-44227 Dortmund, Germ ...;Mathematisches Institut/ZAIK, Universität zu Köln, Weyertal 80, D-50931 Köln, Germany and Universität Dortmund, Fachbereich Mathematik, Vogelpothsweg 87, D-44227 Dortmund, Germ ...
Venue:
Discrete Optimization
Year:
2008

Citing 5
Cited 0

Submodular linear programs on forests

Mathematical Programming: Series A and B
Perspectives of Monge properties in optimization

Discrete Applied Mathematics
A General Class of Greedily Solvable Linear Programs

Mathematics of Operations Research
Structural aspects of ordered polymatroids

Proceedings of the 5th Twente workshop on on Graphs and combinatorial optimization
Dual greedy polyhedra, choice functions, and abstract convex geometries

Discrete Optimization

Quantified Score

Hi-index	0.00

Visualization

Abstract

A pseudolattice L is a poset with lattice-type binary operations. Given a submodular function r:L-R and a modular representation of the pseudolattice as a family of subsets of a set U with certain compatibility properties, we demonstrate that the corresponding unrestricted linear program relative to the representing set family can be solved by a greedy algorithm. This complements the Monge algorithm of Dietrich and Hoffman for the associated dual linear program. We furthermore show that our Monge and greedy algorithms are generally optimal for nonnegative submodular linear programs and their duals (relative to L). Finally, we show that L actually is a distributive lattice with the same supremum operation. Using Birkhoff's representation theorem for distributive lattices, we construct a suitable weight function on P that allows us to reduce the problems to generalized polymatroids.