Linear programming is a special optimization problem which is widely applicable for solving real-world problems. It has a rich discrete geometric structure. Furthermore, there are still several open complexity questions concerning the algorithms to solve linear programs. In this talk we will give a geometric intuition for the problem. We present the simplex method which is the major tool to solve linear programs.