Infeasibility spheres for finding robust solutions of blending problems with quadratic constraints
From MaRDI portal
Publication:925234
DOI10.1007/s10898-007-9157-xzbMath1145.90428OpenAlexW2122992783MaRDI QIDQ925234
Eligius M. T. Hendrix, Leocadio G. Casado, Inmaculada F. García
Publication date: 3 June 2008
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10898-007-9157-x
Related Items (6)
On parallel branch and bound frameworks for global optimization ⋮ Locating a competitive facility in the plane with a robustness criterion ⋮ On determining the cover of a simplex by spheres centered at its vertices ⋮ Pareto optimality and robustness in bi-blending problems ⋮ Simplicial Lipschitz optimization without the Lipschitz constant ⋮ On a branch-and-bound approach for a Huff-like Stackelberg location problem
Cites Work
- Unnamed Item
- The semi-continuous quadratic mixture design problem: description and branch-and-bound approach
- An algorithm for global optimization of Lipschitz continuous functions
- An application of Lipschitzian global optimization to product design
- Finding robust solutions for product design problems
- Subdivision, sampling, and initialization strategies for simplical branch and bound in global optimization.
- Solving standard quadratic optimization problems via linear, semidefinite and copositive pro\-gramming
- D.C. versus copositive bounds for standard QP
- On generalized bisection of 𝑛-simplices
- An algorithm for finding the global maximum of a multimodal, multivariate function
- Branch- and bound algorithms for solving global optimization problems with Lipschitzian structure
- Theoretical comparisons of search strategies in branch-and-bound algorithms
- Branch-and-Bound Methods: General Formulation and Properties
- On uniform covering, adaptive random search and raspberries
This page was built for publication: Infeasibility spheres for finding robust solutions of blending problems with quadratic constraints
