Local minima, marginal functions, and separating hyperplanes in discrete optimization

The goal of this Note is to prove results in optimization of two integer variables which correspond to fundamental results in convex analysis of real variables, viz. that a local minimum of a convex function is global; that the marginal function of a convex function is convex; and that two disjoint convex sets can be separated by a hyperplane.