Note on pseudolattices, lattices and submodular linear programs

A pseudolattice L is a poset with lattice-type binary operations. Assuming that the pseudolattice permits a modular representation as a family of subsets of a set U with certain compatibility properties, we show that L actually is a distributive lattice with the same supremum operation. Given a submodular function r : L R, we prove 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 algorithm is generally optimal for nonnegative submodular linear programs and their duals (relative to L).

• Type: Journal
• Year: 2008
• Where: DISOPT
• Authors: Ulrich Faigle, Britta Peis
• Keywords: DISOPT 2008, Greedy Algorithm, Lattice-type Binary Operations, Linear Programs