Pareto optimality and robustness in bi-blending problems
| Autor: | Juan F. R. Herrera, Leocadio G. Casado, Eligius M. T. Hendrix, Inmaculada García |
|---|---|
| Rok vydání: | 2012 |
| Předmět: |
Statistics and Probability
Mathematical optimization Information Systems and Management Branch and bound Pareto principle WASS Management Science and Operations Research Operationele Research en Logistiek Quadratic equation Cutting stock problem Robustness (computer science) strategies Modeling and Simulation Discrete Mathematics and Combinatorics Quadratic programming Operations Research and Logistics Mathematics |
| Zdroj: | TOP, 22(1), 254-273 TOP 22 (2014) 1 |
| ISSN: | 1863-8279 1134-5764 |
| DOI: | 10.1007/s11750-012-0253-9 |
| Popis: | 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. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|
Full text from SpringerLink