-
Notifications
You must be signed in to change notification settings - Fork 0
/
toy_example.lp
52 lines (52 loc) · 1.25 KB
/
toy_example.lp
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
\ SCIP STATISTICS
\ Problem name : IndependentSet-15_
\ Variables : 15 (15 binary, 0 integer, 0 implicit integer, 0 continuous)
\ Constraints : 25
Maximize
Obj: +1 n_0 +1 n_1 +1 n_2 +1 n_3 +1 n_4 +1 n_5 +1 n_6 +1 n_7 +1 n_8 +1 n_9 +1 n_10 +1 n_11 +1 n_12 +1 n_13
+1 n_14
Subject to
c_0: +1 n_13 +1 n_1 +1 n_6 <= +1
c_1: +1 n_0 +1 n_10 <= +1
c_2: +1 n_3 +1 n_8 <= +1
c_3: +1 n_14 +1 n_2 <= +1
c_4: +1 n_5 +1 n_7 <= +1
c_5: +1 n_11 <= +1
c_6: +1 n_12 <= +1
c_7: +1 n_4 <= +1
c_8: +1 n_9 <= +1
c_9: +1 n_0 +1 n_13 <= +1
c_10: +1 n_0 +1 n_5 <= +1
c_11: +1 n_0 +1 n_8 <= +1
c_12: +1 n_1 +1 n_14 <= +1
c_13: +1 n_1 +1 n_7 <= +1
c_14: +1 n_1 +1 n_11 <= +1
c_15: +1 n_1 +1 n_2 <= +1
c_16: +1 n_2 +1 n_13 <= +1
c_17: +1 n_3 +1 n_10 <= +1
c_18: +1 n_3 +1 n_6 <= +1
c_19: +1 n_4 +1 n_8 <= +1
c_20: +1 n_6 +1 n_10 <= +1
c_21: +1 n_10 +1 n_12 <= +1
c_22: +1 n_11 +1 n_13 <= +1
c_23: +1 n_13 +1 n_14 <= +1
c_24: +1 n_9 <= +1
Bounds
0 <= n_0 <= 1
0 <= n_1 <= 1
0 <= n_2 <= 1
0 <= n_3 <= 1
0 <= n_4 <= 1
0 <= n_5 <= 1
0 <= n_6 <= 1
0 <= n_7 <= 1
0 <= n_8 <= 1
0 <= n_9 <= 1
0 <= n_10 <= 1
0 <= n_11 <= 1
0 <= n_12 <= 1
0 <= n_13 <= 1
0 <= n_14 <= 1
Binaries
n_0 n_1 n_2 n_3 n_4 n_5 n_6 n_7 n_8 n_9 n_10 n_11 n_12 n_13 n_14
End