For the given graph of a Linear Programming Problem, write all the constraints satisfying the given feasible region.

Equation of $\displaystyle A B$ : $\displaystyle y-200=\frac{250-200}{50-0}(x-0)$ i.e. $\displaystyle -x+y=200$ Equation of $\displaystyle B C$ : $\displaystyle y-250=\frac{150-250}{150-50}(x-50)$ i.e. $\displaystyle x+y=300$ Equation of $\displaystyle C D$ : $\displaystyle y-0=\frac{0-150}{200-150}(x-200)$ i.e. $\displaystyle 3 x+y=600$ Required constraints are : \[-x+y \leq 200 \] $\displaystyle x+y \leq 300$ $\displaystyle 3 x+y \leq 600$ $\displaystyle x \geq 0, y \geq 0$