 If the constraints in 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 Verified
147k+ views
Hint: Before attempting this question, one should have prior knowledge about linear programming and also remember that constraints are the restrictions under which we have to maximize or minimize the function, using this information can help you to approach the solution of the question.

According to the given information it is given that constraints of the linear programming are changed and we know that the linear programing function is given as for example $Z = 3x + 4y$ where we have to show that the given function is maximize or minimize under the situation $x + y \geqslant 4,x \geqslant 0,y \geqslant 0$.
The function $Z = 3x + 4y$ is an objective function where as $x + y \geqslant 4,x \geqslant 0,y \geqslant 0$ are the constraints which are the conditions or restrictions under which we have to show that function $Z = 3x + 4y$is maximize or minimize.