4 * @author Sebastian Hack
6 * Copyright (C) 2011 Saarland University
7 * Released under the LGPL
13 #include "lpp_cplex.h"
14 #include "lpp_solvers.h"
15 #include "lpp_gurobi.h"
17 static void dummy_solver(lpp_t *lpp)
21 for(i = 0; i < lpp->var_next; ++i) {
22 lpp->vars[i]->value = i;
23 lpp->vars[i]->value_kind = lpp_value_solution;
27 fprintf(lpp->log, "dummy solver exiting now.\n");
32 lpp->sol_state = lpp_optimal;
35 static void segv_solver(lpp_t *lpp)
39 for(i = 0; i < lpp->var_next; ++i) {
40 lpp->vars[i]->value = i;
41 lpp->vars[i]->value_kind = lpp_value_solution;
45 fprintf(lpp->log, "segv dummy solver exiting now.\n");
51 lpp_solver_t lpp_solvers[] = {
53 { lpp_solve_cplex, "cplex", 1 },
56 { lpp_solve_gurobi, "gurobi", 1 },
58 { dummy_solver, "dummy", 2 },
59 { segv_solver, "segv", 2 },
63 lpp_solver_func_t *lpp_find_solver(const char *name)
67 for(i = 0; lpp_solvers[i].solver != NULL; i++)
68 if(strcmp(lpp_solvers[i].name, name) == 0)
69 return lpp_solvers[i].solver;