40 namespace Test {
namespace FlatZinc {
49 (void)
new FlatZincTest(
"product::lp",
50 "predicate bool_lin_ge(array [int] of int: a, array [int] of var bool: x, var int: c);\n\
51 predicate bool_lin_gt(array [int] of int: a, array [int] of var bool: x, var int: c);\n\
52 predicate bool_lin_lt(array [int] of int: a, array [int] of var bool: x, var int: c);\n\
53 predicate bool_lin_ne(array [int] of int: a, array [int] of var bool: x, var int: c);\n\
54 array [1..2] of int: capacity = [200, 400];\n\
55 array [1..6] of int: consumption = [5, 2, 4, 4, 3, 6];\n\
56 array [1..3] of int: demand = [100, 200, 300];\n\
57 array [1..3] of int: insideCost = [60, 80, 30];\n\
58 array [1..3] of int: outsideCost = [80, 90, 40];\n\
59 var int: INT____00001 :: is_defined_var :: var_is_introduced;\n\
60 array [1..3] of var int: inside :: output_array([1..3]);\n\
61 array [1..3] of var int: outside :: output_array([1..3]);\n\
62 constraint int_le(0, inside[1]);\n\
63 constraint int_le(0, inside[2]);\n\
64 constraint int_le(0, inside[3]);\n\
65 constraint int_le(0, outside[1]);\n\
66 constraint int_le(0, outside[2]);\n\
67 constraint int_le(0, outside[3]);\n\
68 constraint int_lin_eq([-1, 60, 80, 30, 80, 90, 40], [INT____00001, inside[1], inside[2], inside[3], outside[1], outside[2], outside[3]], 0) :: defines_var(INT____00001);\n\
69 constraint int_lin_le([-1, -1], [inside[1], outside[1]], -100);\n\
70 constraint int_lin_le([-1, -1], [inside[2], outside[2]], -200);\n\
71 constraint int_lin_le([-1, -1], [inside[3], outside[3]], -300);\n\
72 constraint int_lin_le([2, 4, 6], [inside[1], inside[2], inside[3]], 400);\n\
73 constraint int_lin_le([5, 4, 3], [inside[1], inside[2], inside[3]], 200);\n\
74 solve minimize INT____00001;\n\
75 ",
"inside = array1d(1..3, [40, 0, 0]);\n\
76 outside = array1d(1..3, [60, 200, 300]);\n\
Gecode::FloatVal c(-8, 8)