### 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

Original language | English |
---|---|

Place of Publication | Wageningen |

Publisher | Wageningen University |

Number of pages | 25 |

Publication status | Published - 2006 |

### Publication series

Name | Mansholt Working paper |
---|---|

Publisher | Wageningen University |

No. | mpw-31 |

## Fingerprint Dive into the research topics of 'Infeasible spheres for finding robust solutions of blending problems with quadratic constraints'. Together they form a unique fingerprint.

## Cite this

Hendrix, E. M. T., Casado, L. G., & García, I. (2006).

*Infeasible spheres for finding robust solutions of blending problems with quadratic constraints*. (Mansholt Working paper; No. mpw-31). Wageningen University. http://www.sls.wau.nl/mi/mgs/publications/Mansholt_Working_Papers/MWP_31.pdf