#if (defined(NO_NULL_COLORS_EXTRA_CSTS) || defined(NO_NULL_COLORS_WITH_COSTS)) && !defined(NO_NULL_COLORS)
#error Chose your weapon!
#endif
#if (defined(NO_NULL_COLORS_EXTRA_CSTS) || defined(NO_NULL_COLORS_WITH_COSTS)) && !defined(NO_NULL_COLORS)
#error Chose your weapon!
#endif
- lpp_solve_net(pi->curr_lp, LPP_HOST, LPP_SOLVER);
-// lpp_solve_cplex(pi->curr_lp);
+// lpp_solve_net(pi->curr_lp, LPP_HOST, LPP_SOLVER);
+ lpp_solve_cplex(pi->curr_lp);
DBG((dbg, LEVEL_1, "Solution time: %.2f\n", pi->curr_lp->sol_time));
}
DBG((dbg, LEVEL_1, "Solution time: %.2f\n", pi->curr_lp->sol_time));
}
sol = xmalloc((pi->last_x_var - pi->first_x_var + 1) * sizeof(*sol));
state = lpp_get_solution(pi->curr_lp, sol, pi->first_x_var, pi->last_x_var);
if (state != lpp_optimal) {
sol = xmalloc((pi->last_x_var - pi->first_x_var + 1) * sizeof(*sol));
state = lpp_get_solution(pi->curr_lp, sol, pi->first_x_var, pi->last_x_var);
if (state != lpp_optimal) {
assert(state >= lpp_feasible && "The solution should at least be feasible!");
}
for (i=0; i<pi->last_x_var - pi->first_x_var + 1; ++i) {
assert(state >= lpp_feasible && "The solution should at least be feasible!");
}
for (i=0; i<pi->last_x_var - pi->first_x_var + 1; ++i) {