A solution procedure based on Lagrangian relaxation for supply chain planning problem with CSR investment.
Takuya AoyamaTatsushi NishiPublished in: IEEM (2015)
Keyphrases
- supply chain
- lagrangian relaxation
- capacity planning
- integer programming
- supply chain management
- pricing schemes
- decision making
- feasible solution
- lower bound
- column generation
- linear programming
- dynamic programming
- np hard
- branch and bound algorithm
- bullwhip effect
- lead time
- inventory control
- lower and upper bounds
- facility location
- service level
- shortest path
- mixed integer programming
- production planning
- upper bound
- optimal solution
- objective function
- network design problem
- branch and bound
- data mining
- search algorithm