Passer à la navigation principale Passer à la recherche Passer au contenu principal

Valid inequalities for the pooling problem with binary variables

  • University of Bologna
  • University of Wisconsin

Résultats de recherche: Le chapitre dans un livre, un rapport, une anthologie ou une collection › Contribution à une conférence › Revue par des pairs

19 Citations (Scopus)

Résumé

The pooling problem consists of finding the optimal quantity of final products to obtain by blending different compositions of raw materials in pools. Bilinear terms are required to model the quality of products in the pools, making the pooling problem a non-convex continuous optimization problem. In this paper we study a generalization of the standard pooling problem where binary variables are used to model fixed costs associated with using a raw material in a pool. We derive four classes of strong valid inequalities for the problem and demonstrate that the inequalities dominate classic flow cover inequalities. The inequalities can be separated in polynomial time. Computational results are reported that demonstrate the utility of the inequalities when used in a global optimization solver.

langue originaleAnglais
titreInteger Programming and Combinatoral Optimization - 15th International Conference, IPCO 2011, Proceedings
Pages117-129
Nombre de pages13
Les DOIs
étatPublié - 11 juil. 2011
Modification externeOui
Evénement15th International Conference on Integer Programming and Combinatorial Optimization, IPCO 2011 - New York, NY, États-Unis
Durée: 15 juin 2011 → 17 juin 2011

Série de publications

NomLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume6655 LNCS
ISSN (imprimé)0302-9743
ISSN (Electronique)1611-3349

Une conférence

Une conférence15th International Conference on Integer Programming and Combinatorial Optimization, IPCO 2011
Pays/TerritoireÉtats-Unis
La villeNew York, NY
période15/06/11 → 17/06/11

Empreinte digitale

Examiner les sujets de recherche de « Valid inequalities for the pooling problem with binary variables ». Ensemble, ils forment une empreinte digitale unique.

Contient cette citation