Solving Mixed Integer Bilinear Problems Using MILP Formulations.
Akshay GupteShabbir AhmedMyun-Seok CheonSantanu S. DeyPublished in: SIAM J. Optim. (2013)
Keyphrases
- mixed integer linear programming
- mixed integer
- linear programming problems
- global optimization problems
- cutting plane
- linear program
- mixed integer program
- quadratic program
- network flow problem
- branch and bound algorithm
- mathematical programming
- benders decomposition
- linear programming
- valid inequalities
- lot sizing
- mixed integer programming
- resource constrained project scheduling problem
- integer variables
- optimal solution
- optimization problems
- continuous variables
- network design problem
- lp relaxation
- production planning
- feasible solution
- convex hull
- continuous relaxation
- quadratic programming
- nonlinear programming
- exact solution
- approximation algorithms
- branch and bound
- dynamic programming
- computational complexity