Abstract
The blending problem is studied as a problem of finding cheap robust feasible solutions on the unit simplex fulfilling linear and quadratic inequalities. Properties of a regular grid over the unit simplex are discussed. Several tests based on spherical regions are described and evaluated to check the feasibility of subsets and robustness of products. These tests have been implemented into a Branch-and-Bound algorithm that reduces the set of points evaluated on the regular grid. The whole is illustrated numerically.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Anstreicher K.M., Burer S. (2005). D.C. versus copositive bounds for standard QP. J. Global Optim. 33: 299–312
Bomze I.M., de Klerk E. (2002). Solving standard quadratic optimization problems via linear, semidefinite and copositive programming. J. Global Optim. 24: 163–185
Claussen J., Zilinskas A. (2002). Subdivision, sampling and initialization strategies for simplical branch and bound in global optimization. Comput. Math. Appl. 44: 943–955
Hendrix E.M.T. (1998). Global Optimization at Work. Wageningen University, Wageningen
Hendrix E.M.T., Klepper O. (2000). On uniform covering, adaptive random search and raspberries. J. Global Optim. 18(2): 143–163
Hendrix E.M.T., Pintér J.D. (1991). An application of Lipschitzian global optimization to product design. J. Global Optim. 1: 389–401
Hendrix E.M.T., Mecking C.J., Hendriks T.H.B. (1996). Finding robust solutions for product design problems. Eur. J. Oper. Res. 92: 28–36
Hendrix, E.M.T., Casado, L.G., García, I.: The semi-continous quadratic mixture design problem. Description and branch-and-bound approach. In press, doi:10.1016/j.ejor.2007.01.056 (2007). Eur. J. Oper. Res.
Horst R. (1997). On generalized bisection of n-simplices. Math. Comput. 66(218): 691–698
Ibaraki T. (1976). Theoretical comparisons of search strategies in branch and bound algorithms. Int. J. Comput. Inform. Sci. 5: 315–344
Meewella C.C., Mayne D.Q. (1988). An algorithm for global optimization of Lipschitz continuous functions. J. Optim. Theory Appl. 57: 307–322
Mitten L.G. (1970). Branch and bound methods: general formulation and properties. Opera. Res. 18: 24–34
Mladineo R.H. (1986). An algorithm for finding the global maximum of a multimodal, multivariate function. Math. Program. 34: 188–200
Pintér J.D. (1988). Branch-and-bound algorithms for solving global optimization problems with Lipschitzian structure. Optimization 19: 101–110
Williams H.P. (1993). Model Building in Mathematical Programming. Wiley & Sons, Chichester
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Casado, L.G., Hendrix, E.M.T. & García, I. Infeasibility spheres for finding robust solutions of blending problems with quadratic constraints. J Glob Optim 39, 577–593 (2007). https://doi.org/10.1007/s10898-007-9157-x
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10898-007-9157-x