Question

Linear programming problems can be solved by​

Answer 1

Answer:

linear program can be solved by multiple methods. ... This method is used to solve a two-variable linear program. If you have only two decision variables, you should use the graphical method to find the optimal solution. A graphical method involves formulating a set of linear inequalities subject to the constraints.

Answer 2

Linear programming problems can be solved by​ various methods, one is the simplex method and the other is the graphical method.

• One of the popular methods of solving the problems of linear programming is the simplex method. There is a transformation of the basic variable for obtaining the value that is maximum and for the objective function.
• To determine the two-variable linear programming we use the graphical method. For performing the graphical method, we set the inequalities which are subjected to constraints.