Pareto optimality and robustness in bi-blending problems

• Juan F.R. Herrera ^[1] ; Leocadio G. Casado ^[1] ; Eligius M.T. Hendrix ^[2] ; Inmaculada García ^[2]
  1. [1] Universidad de Almería

     Universidad de Almería

     Almería, España

     
  2. [2] Universidad de Málaga

     Universidad de Málaga

     Málaga, España

     
• Localización: Top, ISSN-e 1863-8279, ISSN 1134-5764, Vol. 22, Nº. 1, 2014, págs. 254-273
• Idioma: inglés
• Enlaces
  • Texto completo (pdf)
• Resumen

  • The mixture design problem for two products concerns finding simultaneously two recipes of a blending problem with linear, quadratic and semi-continuity constraints. A solution of the blending problem minimizes a linear cost objective and an integer valued objective that keeps track of the number of raw materials that are used by the two recipes, i.e. this is a bi-objective problem. Additionally, the solution must be robust. We focus on possible solution approaches that provide a guarantee to solve bi-blending problems with a certain accuracy, where two products are using (partly) the same scarce raw materials. The bi-blending problem is described, and a search strategy based on Branch-and-Bound is analysed. Specific tests are developed for the bi-blending aspect of the problem. The whole is illustrated numerically.