The restrictions imposed on decision variables involved in an objective function of a linear programming problem are called : (A) feasible solutions (B) constraints (C) optimal solutions (D) infeasible solutions