The optimal lower set is an optimal closure of a directed acyclic graph that has the elements of the partial order as its vertices, with an edge from formula_99 to formula_100 whenever formula_101 in the partial order.