In this paper we develop probabilistic arguments for justifying thequality of an approximate solution for global quadratic minimization problem, obtained as a best point among all points of a uniform grid inside a polyhedral feasible set. Our main tool is a random walk inside the standard...