Relaxations and cutting planes for linear programs with complementarity constraints.
Alberto Del PiaJeff T. LinderothHaoran ZhuPublished in: J. Glob. Optim. (2024)
Keyphrases
- linear program
- cutting plane
- integer program
- mixed integer
- linear programming
- mixed integer program
- multistage stochastic
- column generation
- linear programming relaxation
- linear programming problems
- semi infinite
- integer programming problems
- valid inequalities
- lp relaxation
- np hard
- cutting plane algorithm
- linear inequalities
- mixed integer linear programming
- integer programming
- optimal solution
- simplex method
- objective function
- feasible solution
- lower bound
- dynamic programming
- stochastic programming
- mixed integer programming
- dantzig wolfe decomposition
- primal dual
- interior point methods
- mathematical programming
- extreme points
- integer linear programming
- knapsack problem
- lagrangian relaxation
- semidefinite
- simplex algorithm
- network flow
- bayesian networks