[RBFOpt] problem with binary vector input and linear constraints

[Zhengxing Chen]

Hi,

I have a black-box minimization problem f(x), where x is a binary vector
and x must satisfy some linear equality constraints.

Is RBF-OPT applicable to my problem? I can imagine a way to do it: set
variables to be integers and bound them in [0, 1], and also let f(x) return
a very large number if x doesn't satisfy the constraints. But I'm not sure
if this violates any assumption of the model.

Thanks,
Zhengxing
-------------- next part --------------
An HTML attachment was scrubbed...
URL: <http://list.coin-or.org/pipermail/rbfopt/attachments/20180117/340ecaa5/attachment.html>