In a linear programming problem, the region where all constraints are satisfied is called the:

a) Objective region

b) Feasible region

c) Infeasible region

d) Dual region