The semi-continuous quadratic mixture design problem: Description and branch-and-bound approach
The semi-continuous quadratic mixture design problem (SCQMDP) is described as a problem with linear, quadratic and semi-continuity constraints. Moreover, a linear cost objective and an integer valued objective are introduced. The goal is to deal with the SCQMD problem from a branch-and-bound perspective generating robust solutions. Therefore, an algorithm is outlined which identifies instances where decision makers tighten requirements such that no [epsilon]-robust solution exists. The algorithm is tested on several cases derived from industry.
Year of publication: |
2008
|
---|---|
Authors: | Hendrix, Eligius M.T. ; Casado, Leocadio G. ; García, Inmaculada |
Published in: |
European Journal of Operational Research. - Elsevier, ISSN 0377-2217. - Vol. 191.2008, 3, p. 803-815
|
Publisher: |
Elsevier |
Saved in:
Online Resource
Saved in favorites
Similar items by person
-
Infeasibility spheres for finding robust solutions of blending problems with quadratic constraints
Casado, Leocadio G., (2007)
-
The semi-continuous quadratic mixture design problem: Description and branch-and-bound approach
Hendrix, Eligius M.T., (2008)
-
Pareto optimality and robustness in bi-blending problems
Herrera, Juan F. R., (2014)
- More ...