Infeasibility spheres for finding robust solutions of blending problems with quadratic constraints
From MaRDI portal
(Redirected from Publication:925234)
Recommendations
- Pareto optimality and robustness in bi-blending problems
- On refinement of the unit simplex using regular simplices
- 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
Cites work
- An algorithm for finding the global maximum of a multimodal, multivariate function
- An algorithm for global optimization of Lipschitz continuous functions
- An application of Lipschitzian global optimization to product design
- Branch- and bound algorithms for solving global optimization problems with Lipschitzian structure
- Branch-and-Bound Methods: General Formulation and Properties
- D.C. versus copositive bounds for standard QP
- Finding robust solutions for product design problems
- scientific article; zbMATH DE number 429663 (Why is no real title available?)
- On generalized bisection of 𝑛-simplices
- On uniform covering, adaptive random search and raspberries
- Solving standard quadratic optimization problems via linear, semidefinite and copositive pro\-gramming
- 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
(11)- On a branch-and-bound approach for a Huff-like Stackelberg location problem
- On parallel branch and bound frameworks for global optimization
- Simplicial Lipschitz optimization without the Lipschitz constant
- Constrained global optimization for wine blending
- Optimal information blending with measurements in the \(L^{2}\) sphere
- Locating a competitive facility in the plane with a robustness criterion
- Pareto optimality and robustness in bi-blending problems
- Robust real-time optimization for the linear oil blending
- On determining the cover of a simplex by spheres centered at its vertices
- Local search versus linear programming to detect monotonicity in simplicial branch and bound
- The semi-continuous quadratic mixture design problem: description and branch-and-bound approach
This page was built for publication: Infeasibility spheres for finding robust solutions of blending problems with quadratic constraints
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q925234)
