In a Linear Programming problem, the objective function is always:
Answer & explanation
Correct answer: option 1
The correct answer is Option (1) → Linear
In a linear programming problem, the quantity to be maximised or minimised is of the form
\(Z = ax + by\)
where a and b are constants. Every variable appears only to the first power, so the objective function is always linear; the constraints are linear too. This is what the word “linear” in the name refers to.
NCERT (2026-27 edition):
Linear Programming Problem and its Mathematical Formulation
