What strategy to allocate resources while respecting many constraints

[rocco_sprmnt21]

@odow

# no more than 2 consecutive G[N], G[N] 
    # TODO(odow): is this right? 
    [r in 1:8, g in 3:30], sum(x[r,i,"G\\/N"] for i in g-2:g) <= 2

this should prevent sequences like:
G-G-G, G-N-G, N-GN-G, N-N-N, etc…

@odow

    # no G can follow N 
    [r in 1:8, g in 2:30], x[r,g,"N"] <= 100 * (1 - x[r,g-1,"G"])
    [r in 1:8, g in 2:30], x[r,g,"G/\\N"] <= 100 * (1 - x[r,g-1,"G"])

this should prevent sequences like:
N-G, N-GN, GN-G, GN-GN (so some constraints must be added)
But, I don’t understand why, it doesn’t seem to work for the set constraints either