A center-cut algorithm for quickly obtaining feasible solutions and solving convex MINLP problems.
Jan KronqvistDavid E. BernalAndreas LundellTapio WesterlundPublished in: Comput. Chem. Eng. (2019)
Keyphrases
- mixed integer
- convex hull
- linear programming
- quadratic program
- benchmark problems
- mixed integer nonlinear programming
- feasible solution
- combinatorial optimization
- dynamic programming
- optimal solution
- objective function
- search space
- cost function
- computational complexity
- quadratic programming
- linear programming problems
- nonlinear programming
- integer program
- mixed integer programming
- lagrangian relaxation
- learning algorithm
- exact solution
- genetic algorithm
- convex optimization
- knapsack problem
- exact algorithms
- lp relaxation
- branch and bound
- worst case
- np hard