Mathematics > vectors-and-linear-programming > Linear Programming

Consider the Linear Programming Problem, where the objective function $Z = x + 4y$ needs to be minimized subject to constraints $2x + y \ge 1000$ $x + 2y \ge 800$ $x, y \ge 0$ Draw a neat graph of the feasible region and find the minimum value of $Z$.