How can I solve problems applying the lineal programation methodology? How can I solve problems applying the lineal programation methodology? @Mathematics

Question

anonymous · Answer

Linear programming? It takes several steps. You have to develop all the constraining equations, then graph them, and test all the points of intersection where the lines meet.

anonymous · Answer

There are different methods you can use. The easiest method is graphing, as Cliff explained above. But the problem with this method is that it can't be used if you have more than two constrains. The most famous method in linear programming is the simplex method, which can solve both maximization and minimization problems for any number of constrains. It's a bit lengthy compared to the graphing method though.