Motivation
General Pure Integer Program
min{cx | Bx
B
+ Nx
N
= b,
x
B
, x
N
³
0, integer}
Group Problem (Relaxation)
min{cx | Nx
N
º
b (mod B),
x
N
³
0, integer}
Cyclic Group Problem (Relaxation)
x
1
+ 2x
2
+ 3x
3
+ … + (n-1)x
n-1
º
r (mod n)
x
j
³
0, integer
"
j, x
¹
0