candy-calc/problem.txt
2019-12-09 21:33:20 +01:00

20 lines
240 B
Plaintext

\* Problem: candy *\
Minimize
obj: + 101 xs + 801 s + 3001 m + 10001 l + 30001 xl
Subject To
con: + 100 xs + 800 s + 3000 m + 10000 l + 30000 xl >= {exp}
Bounds
xs <= {xs}
s <= {s}
m <= {m}
l <= {l}
xl <= {xl}
Generals
xs s m l xl
End