Skip to content

Latest commit

 

History

History
8 lines (7 loc) · 290 Bytes

README.md

File metadata and controls

8 lines (7 loc) · 290 Bytes

Dynamic-Programming

Solving three optimization problems with dynamic programming:
1- Maintenance problem.
2- Stock management.
3- Dice trading.

p.s : This is a mini project in the context of my Convex Optimization Course: https://leclere.github.io/teaching/Optim2A.