remove polyhedron_range
[barvinok.git] / polysign_pip.c
blob6b14cdc34804876bcaf2ca48a9b352545300260b
1 #include <assert.h>
2 #include <piplib/piplibMP.h>
3 #include "polysign.h"
5 static PipQuast *solve_lp(int maximize, Matrix *C, Value *f, Value denom)
7 int i;
8 PipMatrix *domain;
9 PipOptions *options;
10 PipQuast *sol;
12 domain = pip_matrix_alloc(C->NbRows+1, C->NbColumns+1);
13 value_set_si(domain->p[0][0], 0);
14 value_set_si(domain->p[0][1], -1);
15 Vector_Copy(f, domain->p[0]+2, C->NbColumns-1);
16 for (i = 0; i < C->NbRows; ++i) {
17 value_assign(domain->p[i+1][0], C->p[i][0]);
18 Vector_Copy(C->p[i]+1, domain->p[i+1]+2, C->NbColumns-1);
21 options = pip_options_init();
22 options->Urs_unknowns = -1;
23 options->Maximize = maximize;
24 options->Nq = 0;
25 sol = pip_solve(domain, NULL, -1, options);
26 pip_matrix_free(domain);
27 pip_options_free(options);
29 return sol;
32 static enum lp_result constraints_affine_minmax(int maximize, Matrix *C,
33 Value *f, Value denom, Value *opt)
35 enum lp_result res = lp_ok;
36 PipQuast *sol = solve_lp(maximize, C, f, denom);
38 if (!sol->list)
39 res = lp_empty;
40 else if (value_zero_p(sol->list->vector->the_deno[0]))
41 res = lp_unbounded;
42 else {
43 if (maximize)
44 mpz_fdiv_q(*opt, sol->list->vector->the_vector[0],
45 sol->list->vector->the_deno[0]);
46 else
47 mpz_cdiv_q(*opt, sol->list->vector->the_vector[0],
48 sol->list->vector->the_deno[0]);
50 pip_quast_free(sol);
51 return res;
54 enum lp_result pip_constraints_opt(Matrix *C, Value *obj, Value denom,
55 enum lp_dir dir, Value *opt)
57 int maximize = dir == lp_min ? 0 : 1;
58 return constraints_affine_minmax(maximize, C, obj, denom, opt);