In the classical linear programming problem the behaviour of continuous, nonnegative variables subject to a system of linear inequalities is investigated. One possible generalization of this problem ...

The inequality will be solved when \({m}\) is isolated on one side of the inequality. This can be done by using inverse operations on each stage of the sum. The final answer is ...