Not necessarily. A constraint can not affect the current optimum but still restrict other feasible solutions. A truly redundant constraint can be removed without changing the feasible region at all.

No, a problem having infinitely many feasible and optimal solutions does not mean the Simplex method must encounter degeneracy.
These two concepts describe completely different geometric properties of a linear programming problem. Infinitely many optimal solutions describe how the objective function aligns with an edge, while degeneracy describes how constraints intersect at a single corner point.

No, the constraint is not redundant. A constraint is redundant only if removing it does not change the entire feasible region; not affecting the current optimum simply means it is non-binding at that particular solution.

No, not necessarily. A constraint can not affect the current optimal solution but still be important because it changes the feasible region. A redundant constraint is one that can be removed without changing the feasible region at all. Therefore, not affecting the optimum is different from being truly redundant.

No, the constraint is not redundant. A constraint is strictly redundant only if removing it leaves the feasible region completely unchanged, meaning it never restricts the solution space under any circumstance.

No, the constraint is not necessarily redundant. A constraint may not affect the current optimal solution but can still restrict other feasible solutions; a truly redundant constraint can be removed without changing the entire feasible region.

No, the constraint is not necessarily redundant. A constraint can have no effect on the current optimal solution while still affecting other parts of the feasible region. A constraint is truly redundant only when removing it does not change the feasible region at all because it is already implied by the other constraints. Therefore, not affecting the optimum is different from being redundant: the first concerns the current best solution, while redundancy concerns the entire feasible region.

Not necessarily. Even if a constraint doesn't limit the current optimal point, it can still restrict other feasible solutions. A constraint is only redundant if removing it leaves the entire feasible region completely unchanged.

No, the constraint is not necessarily redundant. A constraint can not affect the current optimal solution because the optimum already satisfies it without being restricted by it, but it can still restrict other parts of the feasible region. A truly redundant constraint is one whose removal does not change the feasible region at all because the other constraints already imply it. Therefore, not affecting the optimum ≠ being redundant.

No, the constraint is non-redundant (inactive or non-binding) rather than redundant, because a constraint is only truly redundant if removing it leaves the feasible region completely unchanged, whereas an inactive constraint limits the overall feasible region even if it does not happen to pass through the current optimal solution.