In linear programming, objective function and objective constraints are

solved

No worries! We‘ve got your back. Try BYJU‘S free classes today!

linear

Right on! Give the BNAT exam to get a 100% scholarship for BYJUS courses

quadratic

No worries! We‘ve got your back. Try BYJU‘S free classes today!

adjacent

No worries! We‘ve got your back. Try BYJU‘S free classes today!

Open in App

Solution

The correct option is C linear
In linear programming, objective function and objective constraints are linear.

Any linear programming problem must have the following properties:-
1. The relationship between variables and constraints must be linear.
2. The constraints must be non-negative.
3.. objective function must be linear.

Suggest Corrections

Similar questions

The linear inequalities or equations or restrictions on the variables of a linear programming problem are called...... The conditions x ≥ 0, y ≥ 0 are called.......

Objective of linear programming for an objective function is to

row or column modeling.
adjacent modeling.
maximize or minimize.
subset or proper set modeling.

Q. The common region determined by all the constraints including the non-negative constraints x ≥ 0 and y ≥ 0 of a linear programming problem is called

Q. If the constraints in a linear programming problem are changed
(a) the problem is to be re-evaluated
(b) solution is not defined
(c) the objective function has to be modified
(d) the change in constraints is ignored

Q. The common region determined by all the constraints including the non-negative constraints x ≥ 0 and y ≥ 0 of a linear programming problem is called

Join BYJU'S Learning Program