Pareto optimality and robustness in bi-blending problems
From MaRDI portal
(Redirected from Publication:458955)
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)- Constrained global optimization for wine blending
- Optimal blending of out-of-specifications substances
- scientific article; zbMATH DE number 3848963 (Why is no real title available?)
- Robust real-time optimization for the linear oil blending
- 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
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)
