This article defines a new minimization problem, the k-Compartment Problem, and presents its solution. The k-Compartment Problem is to determine the minimum sum of k+1 line segments that intersect two parallel lines which form k compartments.