On Solving Nonsmooth Mixed-Integer Nonlinear Programming Problems by Outer Approximation and Generalized Benders Decomposition.
Zhou WeiM. Montaz AliLiang XuBo ZengJen-Chih YaoPublished in: J. Optim. Theory Appl. (2019)
Keyphrases
- benders decomposition
- mixed integer
- linear program
- convex functions
- nonlinear programming
- network design problem
- optimality conditions
- feasible solution
- mixed integer programming
- lp relaxation
- variational inequalities
- optimal solution
- approximation algorithms
- convex hull
- cutting plane
- exact algorithms
- lot sizing
- valid inequalities
- linear programming
- integer program
- continuous variables
- scheduling problem
- np hard
- special case
- combinatorial optimization
- quadratic programming
- knapsack problem
- column generation
- supply chain
- genetic algorithm