In linear programming, objective function and objective constraints are:
A. Solved
B. Linear
C. Quadratic
D. Adjacent

Hint: For the solution of this type of problem we should know about the properties of linear programming, objective function and objective constraints that are quadratic or in linear form.

Complete step-by-step solution:
Given: we have given any linear programming and we have to tell if the objective function and objective constraints are solved or linear or quadratic or adjacent.
There are some properties present in linear programming problems which are as follows.
Any linear programming problems must have the following properties given below:-
The relationship between variables and constraints must be linear.
The constraints must be non-negative, that is it is always a positive value.
Objective function must be linear for linear programming problems.
So, we find that in the linear programming objective function and objective constraints are linear.
Linear programming is considered as an important technique which is used to find optimal solutions for given constraints. In the term “linear programming” linear means the relationship between multiple variables with degree one.

So, in this problem we have found out that the option B is the correct answer which is linear.

Note: The main objective of linear programming is to maximize or minimize the numerical value. It consists of linear functions which are subjected to the constraints in the form of linear equations or in the form of inequalities.