In a set-covering model, each member of a given set (set 1) must be covered by an acceptable member of another set (set 2).

In a set-covering model, each member of a given set (set 1) must be "covered" by an acceptable member of another set (set 2). The objective of such problems is to minimize the number of elements in set 2 that are needed to cover all the elements in set 1.

Select one:

True

False