1. A constraint that does not affect the feasible region is a?

1. A constraint that does not affect the feasible region is a?

Top of Form

Answer

• redundant constraint
  Explanation:
  If a constraint is redundant, it can be easily removed from the problem without affecting the feasible region. It is not easy to recognize redundancies, but in dual representation, some redundancies can easily be identified. All constraints in the dual network enforce qualities, the redundancies and respective arcs can be deleted. In some linear programming problems, constraints can not be easily identified as redundant therefore it is not possible to remove redundant constraints.
  Reference
  Quantitative Methods for Business (Book Only)
  By David R. Anderson, Dennis J. Sweeney, Thomas A. Williams, Jeffrey D. Camm, James J. Cochran page 263