An approach to solving linear programming $($LP$)$ problems employs the

corner point method. This technique involves looking at the objective

function value at every corner point of the feasible region. Use the corner

point method to solve the LP problem LP$-1$ below. In addition, clearly

explain in your answer what non$-$feasible region means.

LP$-1$

Subject to the constraints:

$50x_1+x_2$

$40x_1+60x_{2}2400$

$x_{1}20$

$x_{2}0$

Constraint $1$

Constraint $2$

Constraint $3$

Constraint $4,$