Optimizing diversity 1

We consider the problem of minimizing the size of a set system G such that every subset of {1 ,...,n } can be written as a disjoint union of at most k members of G ,w herek and n are given numbers. This problem is originating in a real-world application aiming at the diversity of industrial production, and at the same time