A redundant constraint is one that: has a zero coefficient for at least one decision variable.

a. is parallel to the objective function.

b. does not form a unique boundary of the feasible solution space.

c. has multiple coefficients for at least one decision variable.

d. has no coefficient for at least one decision variable.

Question

Josiah Hays

Mathematics

10 May, 02:09

A redundant constraint is one that: has a zero coefficient for at least one decision variable.

a. is parallel to the objective function.

b. does not form a unique boundary of the feasible solution space.

c. has multiple coefficients for at least one decision variable.

d. has no coefficient for at least one decision variable.

+2

Answers (1)

Know the Answer?

Harrison Chen · Answer 1

b. does not form a unique boundary of the feasible solution space.

Step-by-step explanation:

A constraint that does not form a unique boundary of the feasible solution space is called a redundant constraint.

A redundant constraint does not affect the feasible solution region and it commonly occurs in the real world.

By eliminating redundancy, we can simplify the given model.