Given,

The constraints of a linear programming problem are changed.

Now, as per the definition of the Linear Programming Problem,

A Linear programming problem is a linear function (also known an objective function) subjected to certain constraints for which we need to find an optimal solution ( i.e. either a maximum/minimum value) depending on the requirement of the problem.

Here, the LPP is solved using the constraints, so, if the constraints are changed, the problem is to has to be re-calculated with the new constraints provided.

Hence the answer is option A.