4 * @author Sebastian Hack
6 * Copyright (C) 2011 Saarland University
7 * Released under the LGPL
12 #include "lpp_cplex.h"
13 #include "lpp_solvers.h"
15 static void dummy_solver(lpp_t *lpp)
19 for(i = 0; i < lpp->var_next; ++i) {
20 lpp->vars[i]->value = i;
21 lpp->vars[i]->value_kind = lpp_value_solution;
25 fprintf(lpp->log, "dummy solver exiting now.\n");
30 lpp->sol_state = lpp_optimal;
33 static void segv_solver(lpp_t *lpp)
37 for(i = 0; i < lpp->var_next; ++i) {
38 lpp->vars[i]->value = i;
39 lpp->vars[i]->value_kind = lpp_value_solution;
43 fprintf(lpp->log, "segv dummy solver exiting now.\n");
49 lpp_solver_t lpp_solvers[] = {
50 { lpp_solve_cplex, "cplex", 1 },
51 { dummy_solver, "dummy", 2 },
52 { segv_solver, "segv", 2 },
56 lpp_solver_func_t *lpp_find_solver(const char *name)
60 for(i = 0; lpp_solvers[i].solver != NULL; i++)
61 if(strcmp(lpp_solvers[i].name, name) == 0)
62 return lpp_solvers[i].solver;