90C26 Nonconvex programming, global optimization
Refine
Year of publication
Document Type
- ZIB-Report (22)
- Doctoral Thesis (2)
Is part of the Bibliography
- no (24)
Keywords
- Pooling Problem (4)
- nonconvex (3)
- Cutting Planes (2)
- Large Neighborhood Search (2)
- MINLP (2)
- Nonconvexity (2)
- Primal Heuristic (2)
- Quadratic Programming (2)
- Relaxation (2)
- Relaxations (2)
We investigate new convex relaxations for the pooling problem, a classic nonconvex production planning problem in which products are mixed in intermediate pools in order to meet quality targets at their destinations. In this technical report, we characterize the extreme points of the convex hull of our non-convex set, and show that they are not finite, i.e., the convex hull is not polyhedral. This analysis was used to derive valid nonlinear convex inequalities and show that, for a specific case, they characterize the convex hull of our set. The new valid inequalities and computational results are presented in ZIB Report 18-12.