Wednesday, November 9, 2011

Automatic Reformulations

More and more we see that modeling systems apply automatic reformulations.

For instance I see that Cplex’s Concert accepts

model.add (IloMin (x, y) == 0)

for x≥0,y≥0. Essentially this is “x=0 or y=0”. This construct seems to get translated into

a=1 ↔ x = 0
b=1 ↔ y = 0
x,y≥0, a,b∈{0,1}

Here the indicator constraints of Cplex are used, so no upper-bounds are needed. For other MIP solvers one would likely use something like:

x ≤ b * x.up
y ≤ (1-b) * y.up
x,y≥0, b∈{0,1} 

Similarly in the language CMPL we see that x*y is accepted and translated if x or y is a binary or integer variable (see section 7.3).

1 comment:

  1. Hi Erwin, haven't heard about CMPL before - thanks for the link. You seem to have worked with CMPL - how does it compare with OML (MS Solver)?
    In general, there has been a recent proliferation on modeling language. Which are the ones getting traction? May be a blog post is warranted :-)