Once the pseudo-story removed, a linear programming Le Monde mathematical puzzle: For the integer linear programming problem max 2x¹+2x²+x³+…+x¹⁰ under the constraints x¹>x²+x³, x²>x³+x⁴, …, x⁹>x¹⁰+x¹, x¹⁰>x¹+x² find a solution with the maximal number of positive entries. Expressed this way, it becomes quite straightforward to solve with the help of a linear programming R