Branching and bounds tighteningtechniques for non-convex MINLP.
Pietro BelottiJon LeeLeo LibertiFrançois MargotAndreas WächterPublished in: Optim. Methods Softw. (2009)
Keyphrases
- mixed integer
- semi infinite
- second order cone program
- mixed integer nonlinear programming
- quadratic program
- convex hull
- linear program
- branch and bound
- upper bound
- lower bound
- mixed integer linear programming
- semidefinite
- nonlinear programming
- convex optimization
- linear programming
- linear constraints
- single commodity
- saddle point
- feasible solution
- globally optimal
- optimal solution
- maximum margin
- cutting plane
- convex sets
- optimality conditions
- continuous variables
- objective function
- convex constraints
- learning algorithm
- finite dimensional
- semidefinite programming
- hyperplane
- branch and bound algorithm
- graphical models
- worst case
- special case