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

6(2x + 5y)6 (2x) = 12x6 (5y) = 30y12x + 30y

1.   an exact solution requires a radical solution - no decimal approximation.2. (a)4x^3 = 756x^3 = 756/4 = 189x =   cube root of 189 =   5.74   to nearest hundredth answer(b)   189 = 3*3*3*7   so we can write the cube root of 189 as 3∛7 answerchecking (a) 4*(5.74^3 =   756.48   which is very close(b)   4* ((3∛3)^3   = 4*189   = 756   - spot on! 3. i would use solution b because the original question asked for an exact solution.