Variables of the objective function of the linear programming problem are

zero

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

zero or positive

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

negative

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

zero or negative

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

Open in App

Solution

The correct option is B
zero or positive

Explanation for the correct option
The objective function of the linear programming function is the real-valued function whose value is to be either minimized or maximized subject to the constraints defined on the given linear programming problem over the set of feasible solutions. The variables of the objective function of the linear programming problem are zero or positive.
Hence, option B is correct.

Suggest Corrections

Similar questions

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

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. For a linear programming problem we got the following shaded region as the feasible region.

Statement : The objective function will have both maximum and minimum value on the shaded region.

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