Final answer:
Removing a non-redundant constraint from an LP problem expands the feasible region, but may affect the optimal solution.
Step-by-step explanation:
Removing one of a non-redundant constraint from a linear programming (LP) problem will increase the feasible region, not make it smaller. The feasible region represents all possible solutions to the LP problem that satisfy the given constraints. Removing a constraint allows for more flexibility in finding feasible solutions, expanding the feasible region.
However, it is important to note that the removal of a constraint may affect the optimal solution. The optimal solution may change or become infeasible if the removed constraint was crucial in determining the optimal solution.