Skip to content

Applied Mathematics · Ch 10 — Linear Programming Problem

Linear Programming Problem

10.1

Linear Programming Problem

Linear programming is a mathematical technique for finding the best possible outcome — maximum profit or minimum cost — under a given set of constraints. In this section, you will learn how to model real-world problems using linear inequalities, where both the objective function (what you want to optimise) and the constraints are linear in the decision variables. The key idea is to identify the feasible region, which contains all possible solutions, and then locate the corner point that gives the op …