New Multi-product Valid Inequalities for a Discrete Lot-sizing Problem.
Céline GicquelMichel MinouxPublished in: ICORES (2014)
Keyphrases
- lot sizing
- valid inequalities
- mixed integer programming
- mixed integer
- production planning
- multi item
- mixed integer program
- multistage
- single item
- linear programming relaxation
- cutting plane
- continuous variables
- lead time
- setup cost
- linear programming
- integer programming
- fixed cost
- lot size
- production cost
- planning horizon
- traveling salesman problem
- finite number
- reinforcement learning
- supply chain
- lower bound
- lower and upper bounds
- feasible solution