Lift-and-project cuts for convex mixed integer nonlinear programs.
Mustafa R. KilinçJeff T. LinderothJames R. LuedtkePublished in: Math. Program. Comput. (2017)
Keyphrases
- mixed integer
- quadratic program
- convex hull
- linear program
- mixed integer programming
- lot sizing
- continuous relaxation
- cutting plane
- convex optimization
- benders decomposition
- integer variables
- valid inequalities
- feasible solution
- linear programming problems
- optimal solution
- continuous variables
- piecewise linear
- approximation algorithms
- network design problem
- quadratic programming
- linear constraints
- linear programming
- lagrangian heuristic
- convex sets
- convex functions
- maximum likelihood
- training set