Valid inequalities for the single-item capacitated lot sizing problem with step-wise costs.
Ayse AkbalikYves PochetPublished in: Eur. J. Oper. Res. (2009)
Keyphrases
- single item
- multi item
- step wise
- valid inequalities
- lot sizing
- mixed integer programming
- mixed integer
- integer programming
- traveling salesman problem
- multistage
- cutting plane
- convex hull
- production planning
- linear programming
- primal dual
- lower and upper bounds
- column generation
- feasible solution
- lot size
- setup cost
- combinatorial auctions
- production cost
- lead time
- integer program
- lp relaxation
- planning horizon
- linear program
- computational complexity
- fixed cost
- special case