Dynamic Programming

Dynamic programming (planning) is a mathematical method for finding optimal solutions for resource allocation

Application Features

- Special keyboard for more convenient data entry;

- Full, step by step description of solutions;

- Works without access to the Internet

web version - https://linprog.com/main-dynamic-programming

Keywords: Matrix games,

special maths, simplex method,

the traveling salesman problem, the dual task,

dynamic programming, dynamic planning,

resource allocation