TSO-DSO Operational Planning Coordination through Surrogate Lagrangian Relaxation.
Mikhail A. BraginYury DvorkinPublished in: CoRR (2021)
Keyphrases
- lagrangian relaxation
- integer programming
- feasible solution
- linear programming
- lower bound
- dynamic programming
- np hard
- branch and bound algorithm
- column generation
- capacity constraints
- mixed integer program
- dual decomposition
- lower and upper bounds
- shortest path
- relaxation algorithm
- single machine scheduling problem
- lagrangian heuristic
- mixed integer linear programs
- mixed integer programming
- network design problem
- subgradient method
- plan execution
- special case
- production planning
- tabu search
- upper bound
- heuristic search
- scheduling problem
- objective function
- lagrangian dual
- mathematical model