Academy
Formulas/maths/Linear Inequalities and Linear Programming

Linear Inequalities and Linear Programming

Modulus Inequality (Bounded Above)
Gives the solution interval for a linear modulus expression bounded from above.
Modulus Inequality (Bounded Below)
Gives the solution set for a linear modulus expression bounded from below.
Double Modulus Inequality
Gives the union of intervals satisfying a two-sided absolute value inequality.
Corner Point Theorem
States that the optimal value of a linear objective function occurs at a vertex of the feasible region.
Multiple Optimal Solutions
States that if two corner points give the same optimal value, every point on their segment is optimal.