  In this paper we study the normality of monomial ideals using linear
programming and graph theory. We give normality criteria for monomial ideals,
for ideals generated by monomials of degree two, and for edge ideals of graphs
and clutters and their ideals of covers.
