0-1 optimization and non-linear programming

— The optimisation problem for pseudo-Boolean functions is : Find the points of minima of f on the vertices of the n-dimensional unit cube where f is a real polynomial linear in each variable. This discrete problem is equivalent to the continuous problem : Find the points of minima off on the n-dimensional unit cube.