The semi-continuous quadratic mixture design problem: description and branch-and-bound approach
From MaRDI portal
(Redirected from Publication:932200)
Recommendations
- Pareto optimality and robustness in bi-blending problems
- Infeasibility spheres for finding robust solutions of blending problems with quadratic constraints
- Integer Programming and Combinatorial Optimization
- A standard branch-and-bound approach for nonlinear semi-infinite problems
- Semi-continuous quadratic optimization: existence conditions and duality scheme
Cites work
- scientific article; zbMATH DE number 429663 (Why is no real title available?)
- An application of Lipschitzian global optimization to product design
- Branch-and-Bound Methods: General Formulation and Properties
- D.C. versus copositive bounds for standard QP
- Finding robust solutions for product design problems
- Introduction to global optimization
- On generalized bisection of 𝑛-simplices
- Rigorous global search: continuous problems
- 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.
- Theoretical comparisons of search strategies in branch-and-bound algorithms
Cited in
(6)- Infeasibility spheres for finding robust solutions of blending problems with quadratic constraints
- On refinement of the unit simplex using regular simplices
- On determining the cover of a simplex by spheres centered at its vertices
- On the exhaustivity of simplicial partitioning
- Pareto optimality and robustness in bi-blending problems
- On a global optimization algorithm for bivariate smooth functions
This page was built for publication: The semi-continuous quadratic mixture design problem: description and branch-and-bound approach
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q932200)
