Can anyone suggest me a solver for binary linear multiplicative programming problem?

The example case is as follows: Maximize(a1 * X1 + a2 * X2 + a3 * X3 + a1 * a2 * Y12 + a1 * a3 * Y13 + a2 * a3 * Y23) constraints are: a1, a2, a3 are binary variable belongs to [0, 1], and a1 + a2...

24 December 2019 6,060 4 View