Abstract

The problem of linear programming is a linear problem to determine the magnitude of the value of each variable so that the value of the objective function or objective can be optimum, namely by maximizing or minimizing. To solve linear programming problems, a mixed method can be used, namely a method that combines two methods at once, namely the elimination method and the substitution method. The elimination method is a method that eliminates variables by adding or subtracting two equations that have the same coefficient. While the substitution method is the replacement of a variable with a variable from another equation.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call