If x and y are integers, how would you ensure, by imposing
constraints in a binary linear program, that at least one of the
following four inequalities must be true: -4x+3y>= -10,
-x_y+5<=0, x+5y-6<=0 and 2x+3y>=5. Also, would the
constraints you impose work if x and y are not restricted to be
integers?





