We consider the proximity question in integer linear programming (ILP) --- Given a vertex of a polyhedron, how close is the nearest integer point (assuming one exists) in the polyhedron? Upper bounds on proximity are useful in the analysis of various ILP algorithms. In this talk we motivate the proximity question and cover a few recent results. We pose some questions related to matroid theory and convex geometry.