A simple pooling model with application in the feed industry and its global solution analysis

We present a specific pooling model which, while simple, still uses bi-linear objective and constraints. An absolute lower bound is available for this model. We conjecture that any local solution is a global minimizer for this simple instance. We will motivate its usage within a feed industry application. We will then present several experiments to support our conjecture. Since the dimension is in the hundreds, no global solver is able to solve it. Among arguments to support our conjecture is the fact that for smaller instances solvable by global solvers, the solutions computed by local solvers are indeed global