Afeasible solution to a linear programming problem:
o must be a corner point of the feasible region.
o must satisfy all of the problem's constraints simultaneously.
o need not satisfy all of the constraints, only the non-negativity constraints.
o must give the maximum possible profit.
o must give the minimum possible cost.

Worth 100 points need the answers asap first row -x^2 2x^2 (x/2)^2 x^2 x is less than 2 x is greater than 2 x is less than or equal to 2 x is greater than or equal to 2 second row -5 -5/2 4 5 •2 is less than x& x is less than 4 •2 is less than or equal to x & x is less than or equal to 4 •2 is less than or equal to x& x is less than 4 •2 is less than x& x is less than or equal to 4