LP approximations to mixed-integer polynomial optimization problems.
Daniel BienstockGonzalo MuñozPublished in: CoRR (2015)
Keyphrases
- mixed integer
- optimization problems
- linear program
- objective function
- feasible solution
- linear programming
- evolutionary algorithm
- optimal solution
- benders decomposition
- metaheuristic
- mixed integer programming
- lot sizing
- valid inequalities
- convex hull
- cutting plane
- linear programming problems
- network design problem
- continuous relaxation
- mixed integer program
- knapsack problem
- cost function
- quadratic program
- combinatorial optimization
- continuous variables
- search space
- lp relaxation
- np hard
- traveling salesman problem
- primal dual
- column generation
- multistage
- simplex method
- multi objective
- special case
- integer programming