Duality for mixed-integer convex minimization.
Michel BaesTimm OertelRobert WeismantelPublished in: Math. Program. (2016)
Keyphrases
- mixed integer
- convex minimization
- linear programming
- linear program
- feasible solution
- global convergence
- benders decomposition
- lot sizing
- optimal solution
- convex hull
- continuous relaxation
- mixed integer program
- lagrangian heuristic
- continuous variables
- network design problem
- primal dual
- global optimum
- duality gap
- np hard
- search algorithm
- neural network