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.
Denise M. Halverson, Professor of Mathematics,Brigham Young University, Provo, Utah email@example.com
"The k-Compartment Problem,"
Rose-Hulman Undergraduate Mathematics Journal: Vol. 6
, Article 1.
Available at: http://scholar.rose-hulman.edu/rhumj/vol6/iss1/1