Practical application of geometric algorithms is hindered by data imprecision. One of the primitive elements in geometry is the concept of a line. We investigate what is the right way to model imprecise lines, and present algorithms to compute bounds on the solution to linear programming or vertical extent problems on a set of imprecise lines.