Jip J. Dekker
fad1b07018
git-subtree-dir: software/minizinc git-subtree-split: 4f10c82056ffcb1041d7ffef29d77a7eef92cf76
31 lines
745 B
MiniZinc
31 lines
745 B
MiniZinc
/***
|
|
!Test
|
|
solvers: [cbc]
|
|
expected: !Result
|
|
solution: !Solution
|
|
K: 11
|
|
***/
|
|
|
|
% Regession test for Minizinc bug #222. This model caused
|
|
% a series of problems with the FlatZinc MIP (Cbc) backend.
|
|
% Cbc version 2.7.5 was the first version with which this worked.
|
|
|
|
array [1..40] of var int: pl ;
|
|
var 9..15: K; %= 11;
|
|
array [1..40] of var 0..1: B1 ;
|
|
array [1..40] of var 0..1: B2 ;
|
|
int: BigM = 10000 ;
|
|
|
|
constraint forall (F in 1..40)(F + 42*(1-B1[F]) >= K-6);
|
|
constraint forall (F in 1..40)(F + 45*(1-B2[F]) >= K-3);
|
|
|
|
constraint forall (F in 1..33)
|
|
( BigM*B1[F] + sum (M in F..F+7) (pl[M]) >= 1 );
|
|
|
|
constraint forall (F in 1..36)
|
|
( sum (M in F..F+4) (pl[M]) <= -1 + BigM*B2[F] ) ;
|
|
|
|
solve maximize K ;
|
|
|
|
output ["K = ", show(K), "\n"];
|