Problems of minimizing weights of ideals are considered that arise in solving the shadow minimization problem for subsets of a layer of the Boolean cube. It is shown that the lexicographic intervals of such a layer minimize a large class of weight functions, including the function correspond ing to a one sided shadow. Sets minimizing the sums and products of one sided shadow weight func tions are described for certain cardinalities.