Pareto optimality and robustness in bi-blending problems

DOI10.1007/S11750-012-0253-9MaRDI QIDQ458955zbMATHOpenAlexFDO

Authors Juan F. R. Herrera, E. M. T. Hendrix, L. G. Casado, I. 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

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

Recommendations

• Infeasibility spheres for finding robust solutions of blending problems with quadratic constraints
• scientific article; zbMATH DE number 3848963
• Optimal Mixture Choice
• The semi-continuous quadratic mixture design problem: description and branch-and-bound approach
• Biobjective robust optimization over the efficient set for Pareto set reduction

Cites work

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

Cited in

(6)

• Optimal blending of out-of-specifications substances
• The semi-continuous quadratic mixture design problem: description and branch-and-bound approach
• Robust real-time optimization for the linear oil blending
• scientific article; zbMATH DE number 3848963 (Why is no real title available?)
• Infeasibility spheres for finding robust solutions of blending problems with quadratic constraints
• Constrained global optimization for wine blending

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q458955)