In linear programming, objective function and objective constraints are:A. SolvedB. LinearC. QuadraticD. Adjacent

The correct answer is B. Linear.

Explanation:
Linear programming (LP) is a mathematical technique used for optimization, where the goal is to maximize or minimize a linear objective function subject to a set of linear constraints.

Objective Function:

This is the function that needs to be optimized (maximized or minimized).
It is expressed in the form:
Z = c1x1 + c2x2 + ... + cnxn
where c1, c2, ..., cn are coefficients, and x1, x2, ..., xn are variables.
Constraints:

These are linear equations or inequalities that define the feasible region.
They are expressed in the form:
a1x1 + a2x2 + ... + anxn ≤ b
or
a1x1 + a2x2 + ... + anxn ≥ b
where a1, a2, ..., an are coefficients, and b is a constant.
In linear programming, both the objective function and the constraints must be linear, meaning that the variables appear only to the first power, are not multiplied by each other, and do not appear as functions like square roots, exponentials, or trigonometric terms. Hence, the correct answer is B. Linear.