Abstract:
A simple old arithmetic problem set by Adam Riese is considered. On the base of it the modern simplex-method of solving linear optimization problems and some of its variations are illustrated.
Keywords:linear programming, the simplex method, optimal integer solution.