The author shows that Fourier’s classical method from 1826 of eliminating variables from a system of linear inequalities can be, in principle, used for solving linear programming problems. The method, however, is impractical since the number of inequalities generated grows very rapidly. He also demonstrates how the idea of the duality theorem and of the dual simplex method arises in connection with Fourier’s elimination.