Reformulations to improve the Lagrangian relaxation approach for the capacitated multi-product dynamic lot sizing problem with batch ordering.
Kevin A. BunnJosé A. VenturaPublished in: Int. J. Prod. Res. (2024)
Keyphrases
- lagrangian relaxation
- capacity constraints
- facility location
- np hard
- network design problem
- integer programming
- feasible solution
- lagrangian heuristic
- lower bound
- dual decomposition
- neural network
- production planning
- lower and upper bounds
- single machine scheduling problem
- branch and bound algorithm
- linear programming
- learning algorithm
- valid inequalities
- routing problem
- minimum cost
- relaxation algorithm