Improvements to the stand and hit algorithm
Arnon Boneh, Shahar Boneh, Richard J. Caron, Shafiu Jibrin · OSTI OAI (U.S. Department of Energy Office of Scientific and Technical Information) · 1994
The stand and hit algorithm is a probabilistic algorithm for detecting necessary constraints. The algorithm stands at a point in the feasible region and hits constraints by moving towards the boundary along randomly generated directions. In this talk we discuss methods for choosing the standing point. As well, we present the undetected first rule for determining the hit constraints.