Pareto optimality and robustness in bi-blending problems
From MaRDI portal
Publication:458955
DOI10.1007/S11750-012-0253-9zbMATH Open1304.90185OpenAlexW1965283433MaRDI QIDQ458955FDOQ458955
E. M. T. Hendrix, L. G. Casado, Juan F. R. Herrera, 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
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
Multi-objective and goal programming (90C29) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Nonconvex programming, global optimization (90C26)
Cites Work
- Branch-and-Bound Methods: General Formulation and Properties
- Finding robust solutions for product design problems
- Infeasibility spheres for finding robust solutions of blending problems with quadratic constraints
- On generalized bisection of 𝑛-simplices
- Evaluation of three production planning procedures for the use of recipe flexibility
- Subdivision, sampling, and initialization strategies for simplical branch and bound in global optimization.
- Theoretical comparisons of search strategies in branch-and-bound algorithms
- The semi-continuous quadratic mixture design problem: description and branch-and-bound approach
Cited In (4)
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)
