On the problem of maximizing a modular function in the geometric lattice

The problem of maximizing a modular set function on order ideal in the finite geometric lattice is considered. Possibility of generalizing the Rado–Edmonds theorem is studied. A performance guarantee of the greedy algorithm generalizing the known Jenkyns–Korte–Hausmann bound for the problem of maximizing an additive function on independence system is obtained.