Linear programming seeks to optimize (maximize or minimize) a linear objective function, given a set of linear constraints.
The general form of the objective function is: \[ Z = ax + by, \] where \( Z \) represents the quantity to be optimized, and \( x, y \) are the decision variables constrained by the problem. The correct answer is (B) linear function.