The semi-continuous quadratic mixture design problem: description and branch-and-bound approach

DOI10.1016/j.ejor.2007.01.056zbMath1156.90008OpenAlexW1989404966MaRDI QIDQ932200

Leocadio G. Casado, Eligius M. T. Hendrix, Inmaculada F. García

Publication date: 10 July 2008

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2007.01.056

zbMATH Keywords

quadratic programmingbranch-and-boundblendingrobust solutions

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Quadratic programming (90C20)

Related Items (6)

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 ⋮ Infeasibility spheres for finding robust solutions of blending problems with quadratic constraints ⋮ On a global optimization algorithm for bivariate smooth functions ⋮ On refinement of the unit simplex using regular simplices

Uses Software

• INTOPT_90

Cites Work

• Unnamed Item
• An application of Lipschitzian global optimization to product design
• Finding robust solutions for product design problems
• Rigorous global search: continuous 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
• Introduction to global optimization
• D.C. versus copositive bounds for standard QP
• On generalized bisection of 𝑛-simplices
• Theoretical comparisons of search strategies in branch-and-bound algorithms
• Branch-and-Bound Methods: General Formulation and Properties

This page was built for publication: The semi-continuous quadratic mixture design problem: description and branch-and-bound approach