Pareto optimality and robustness in bi-blending problems

DOI10.1007/S11750-012-0253-9zbMath1304.90185OpenAlexW1965283433MaRDI QIDQ458955

Juan F. R. Herrera, Eligius M. T. Hendrix, 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 programmingbranch-and-boundblendingrobust solutions

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Nonconvex programming, global optimization (90C26) Multi-objective and goal programming (90C29)

Cites Work

• Infeasibility spheres for finding robust solutions of blending problems with quadratic constraints
• The semi-continuous quadratic mixture design problem: description and branch-and-bound approach
• Evaluation of three production planning procedures for the use of recipe flexibility
• Finding robust solutions for product design problems
• Subdivision, sampling, and initialization strategies for simplical branch and bound in global optimization.
• On generalized bisection of 𝑛-simplices
• Theoretical comparisons of search strategies in branch-and-bound algorithms
• Branch-and-Bound Methods: General Formulation and Properties

This page was built for publication: Pareto optimality and robustness in bi-blending problems