21CouenneProblem *
readProblem (Bonmin::BabSetupBase *base = NULL,
26 CouenneProblem *p =
new CouenneProblem (NULL, base, jnlst);
38 for (
int i = 0; i < n_var; i++)
39 p -> addVariable (
false, p -> domain ());
42 expression *expr = NULL;
44 p -> addObjective (expr,
"min");
57 *x = (CouNumber *)
malloc (n_var *
sizeof (CouNumber)),
58 *lb = (CouNumber *)
malloc (n_var *
sizeof (CouNumber)),
59 *ub = (CouNumber *)
malloc (n_var *
sizeof (CouNumber));
61 for (
int i = n_var; i--;)
64 lb [i] = -COUENNE_INFINITY;
65 ub [i] = COUENNE_INFINITY;
69 p -> domain () -> push (n_var, x, lb, ub);
77 for (
register int i=n_var; i--;)
79 p -> Lb (i) = - COUENNE_INFINITY;
80 p -> Ub (i) = COUENNE_INFINITY;