Large‐scale standard pooling problems with constrained pools and fixed demands

We present a new variant of the standard pooling problem in which demands are fixed and there are specific constraints on the intermediate pool. We propose a new formulation composed of proportion‐flow variables, and we design an exact branch and bound algorithm by combining existing algorithms. Difficult instances have been generated to demonstrate the efficiency of our method, and our results are compared with those of Couenne, a generic MINLP solver.