Problem $\mathrm{A}$ is a given formulation of a linear program with an optimal solution. Problem $\mathrm{B}$ is a formulation obtained from Problem A by omitting constraint 1 of Problem A and leaving all other things unchanged. Problems A and B will have
A) the same optimal solution and same objective function value
B) the same optimal solution but different objective function values
C) different optimal solutions but same objective function value
D) different optimal solutions and different objective function values
E) same or different solution profile depending on the role of the constraints in the solutions

Question

Quizplus · Accepted Answer

Removing a constraint from a linear programming problem can either have no effect on the optimal solution (if the constraint was not active at the optimal solution) or can change the feasible region, potentially leading to a different optimal solution and/or objective function value.

Problem A\mathrm{A}A Is a Given Formulation of a Linear Program with an with an Optimal

Problem $\mathrm{A}$ Is a Given Formulation of a Linear Program with an with an Optimal