General statement of the problem: An objective function (criterion of optimality) and a system of constraints (usually in the form of inequalities) that are imposed on variables are given.
To apply the graphical method for solving linear programming problems, the number of variables must be equal to two. Then each of the inequalities of the linear programming problem defines a certain half-plane on the coordinate plane, and the system of inequalities as a whole defines the intersection of the corresponding half-planes. The set of points of intersection of these half-planes is called the region of admissible values (ADV).
The optimal solution is always located at the border of the LDV, for example, at the last vertex of the LDV polygon, through which the line of the objective function will pass. The method also takes into account the cases of unboundedness of the DLO and the absence of a solution.
Enter the number of restrictions