Linear programming is a technique to solve optimization problems whose constraints and outcome are represented by linear relationships. Simply put, linear programming allows to solve problems of the following kind: Maximize/minimize $\hat C^T \hat X$ Under the constraint $\hat A \hat X \leq \hat B$ And the constraint $\hat X \geq 0$ This doesn’t seem much when you glance at it but in practice...