Infeasibility spheres for finding robust solutions of blending problems with quadratic constraints

@article{Casado2007InfeasibilitySF,
  title={Infeasibility spheres for finding robust solutions of blending problems with quadratic constraints},
  author={Leocadio G. Casado and Eligius M. T. Hendrix and Inmaculada Garc{\'i}a},
  journal={J. Global Optimization},
  year={2007},
  volume={39},
  pages={577-593}
}
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… CONTINUE READING