Integer linear programming

Attempting Eric Wastl’s Advent of Code introduced me to an integer linear programming problem: Minimise subject to . Solution If a solution exists, the solution (I learnt but did not discover) is to write in binary: or: Consequently: and, re-arranging: We require that . This problem, , has the same form as the original problem, […]