We consider the problem of constructing generic supporting hyperplanes to be used within a (branch and) bound-and-cut algorithm. We review some of the properties that these hyperplanes should enjoy. It is generally admitted that they should cut a parasitic point generated during the process. https://www.lightemupsequences.com/top-deal-Midway-Arcade-Treasures-GameCube-deal-zone/