Linear programming is a part of mathematics used for making problems with multiple variables easier to solve. Also, it is used for achieving minimum and maximum results that would fulfill the existing conditions and requirements. Linear programming is a method of mathematical programming whose purpose is achieving the best possible outcome. Out of all the methods used in linear programming, the simplex method is the best known and the oldest algorithm. Nowadays, there are faster and better methods, but the simplex method is still considered the queen of programming. While observing the economic problems, the geometric linear systems are used to describe the conditions in which the economic problems are taking place, while the linear function describes a certain requirement (goal) that wants to be achieved under those conditions. Namely, linear programming enabled great progress and offered help with solving many economic and scientific problems while also contributing to the facilitated decision making. The tendency of today’s society is finding a short-term solution to a problem, and because of that, many computer programs have been developed. Programs can make it easier to solve a problem and they can be used for faster problem-solving. PHPsimplex is one of those programs used for quick and simple problem-solving. In this paper, the focus is on defining the concepts of linear programming, the history of linear programming, the tasks of linear programming, the geometrical resolution of linear programming, and ultimately, the linkage of theoretical and practical parts of this paper are processed in the PHPsimplex program.