Singular

Let I be an ideal generated by a finite number of binomials, and let I' be a larger ideal containing all polynomials p such that mp is contained in I for some monomial m. Is there an algorithm for computing I'?

That seems to be the ideal qotient:
I:<x_1,...x_n>:={f, with f*g in I and g in <x_1..x_n>}
or
.
For the algorithm see
http://www.mathematik.uni-kl.de/~zca/Reports_on_ca/02/paper_html/node29.html

Thank you for the answer. However, the given quotient does not in general agree with I'. For example, if I is generated by s2-s and d4e+s, then I' contains the polynomial s-1 which is not in quotient(I,maxideal(1)).