Pareto optimality and robustness in bi-blending problems

DOI10.1007/s11750-012-0253-9zbMath1304.90185MaRDI QIDQ458955

Eligius M. T. Hendrix, Juan F. R. Herrera, Leocadio G. Casado, Inmaculada F. García

Publication date: 8 October 2014

Published in: Top (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11750-012-0253-9

zbMATH Keywords

quadratic programming; branch-and-bound; blending; robust solutions

Mathematics Subject Classification ID

90C57: Polyhedral combinatorics, branch-and-bound, branch-and-cut

90C26: Nonconvex programming, global optimization

90C29: Multi-objective and goal programming