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

Open in App

Solution

(a) the problem is to be re-evaluated

The optimisation of the objective function of a LPP is governed by the constraints.
Therefore, if the constraints in a linear programming problem are changed, then the problem needs to be re-evaluated.

Suggest Corrections

Similar questions

Q. If the constraints in linear programming problem are changed

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.......

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. The solution of the set of constraints of a linear programming problem is a convex (open or closed) is called ______ region.

Join BYJU'S Learning Program

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

(a) the problem is to be re-evaluated The optimisation of the objective function of a LPP is governed by the constraints. Therefore, if the constraints in a linear programming problem are changed, then the problem needs to be re-evaluated.

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

(a) the problem is to be re-evaluated

The optimisation of the objective function of a LPP is governed by the constraints.
Therefore, if the constraints in a linear programming problem are changed, then the problem needs to be re-evaluated.