Editing Glove problem (section)

{{technical|date=December 2016}}

In [[operations research]], the '''glove problem'''<ref>{{MathWorld|title=Glove Problem|id=GloveProblem}}</ref> (also known as the '''condom problem'''<ref>Vardi, I. The Condom Problem. Ch. 10 in ''Computational Recreations in Mathematica''. Redwood City, CA: Addison&ndash;Wesley, pp.&nbsp;203&ndash;222, 1991. {{ISBN|0-201-52989-0}}.</ref>) is an [[optimization problem]] used as an example that the cheapest capital cost often leads to dramatic increase in operational time, but that the shortest operational time need not be given by the most expensive capital cost.<ref>{{cite book |first=A. |last=Hajnal |author-link=András Hajnal |first2=L. |last2=Lovász |authorlink2=László Lovász |chapter=An Algorithm to Prevent the Propagation of Certain Diseases at Minimum Cost |title=Interfaces between Computer Science and Operations Research |editor=J. K. Lenstra |editor-link=J. K. Lenstra |editor2=A. H. G. Rinnooy Kan |editor2-link=Alexander Rinnooy Kan |editor3=P. van Emde Boas |publisher=[[Mathematisch Centrum]] |year=1978}}</ref>