Linear programming involves finding the maximum or minimum value of a linear objective function, subject to linear constraints.
The objective function is of the form: \[ Z = ax + by, \] where \( Z \) is the value to be optimized, and \( x, y \) are variables subject to constraints. The correct answer is (B) linear function.