Question:
Consider the Linear Programming Problem, where the objective function \(Z=(x+4y)\) needs to be minimized subject to constraints \(2x+y\ge1000\), \(x+2y\ge800\), \(x,y\ge0\). Draw a neat graph of the feasible region and find the minimum value of Z.