In Linear Programming, the "optimal solution" is always found at:

a) A random point in the feasible region

b) A vertex (corner point) of the feasible region

c) The midpoint of the feasible region

d) Outside the feasible region