← Lab · Chapter: DP for the uncapacitated lot sizing problem

Wagner-Whitin for uncapacitated lot sizing

The recurrence v(t) tries every period of the last production run: a shortest path in the network of the production runs, then the optimal plan. ◀ ▶ one step at a time, «Run» to watch them all (choose the speed); the «Instance» menu and «Edit…» change the instance.