[SCIP] reformulations and convex MINLP

[Miles Lubin]

Dear SCIP experts,

I would like to accurately characterize SCIP's handling of convex MINLP for
my thesis. The best reference I can find for how SCIP deals with convex
MINLP is this 2012 ISMP talk (
https://www.math.hu-berlin.de/~stefan/SCIP_ISMP12.pdf) by Stefan. Slide 9
states that if a composition of functions f(g(x)) is known to be convex or
concave, then no auxiliary variables are added. (This is in contrast to the
nonconvex case where z = g(x) will be introduced.) Is this statement still
accurate?
If so, is it also the case that if a constraint is of the form f(x) + g(x)
<= 0, and both f() and g() are heuristically detected to be convex, then no
auxiliary variables are added?

Thanks!
Miles
-------------- next part --------------
An HTML attachment was scrubbed...
URL: <http://listserv.zib.de/pipermail/scip/attachments/20170414/ef957db4/attachment.html>