In a linear programming problem, the linear function which has to be maximized or minimized is called (A) a feasible function (B) an objective function (C) an optimal function (D) a constraint