The simplex method is universal. It allows you to solve any linear programming problems.
Òhe solution by the simplex method is not as difficult as it might seem at first glance.
This program finds a general solution only for the case when the solution is a line segment.
You can solve your problem or see examples of solutions that the program has made.
Example ¹1. Finding a maximum value of the function
Example ¹2. Finding a minimum value of the function
Example ¹3. Finding a maximum value of the function (artificial variables)
Example ¹4. Finding a minimum value of the function (artificial variables)
Example ¹5. Solution is not the only one
Example ¹6. Function increases unlimitedly
Example ¹7. Function decreases unlimitedly
Example ¹8. Region of feasible solutions is an empty set