Paper bag problem

{{Short description|On volume enclosed by two rectangles}} [[Image:Cushion.jpg|right|thumb|A cushion filled with stuffing]] In [[geometry]], the '''paper bag problem''' or '''teabag problem''' is to calculate the maximum possible inflated volume of an initially flat sealed rectangular bag which has the same shape as a [[cushion]] or [[pillow]], made out of two pieces of material which can bend but not stretch.

According to Anthony C. Robin, an approximate formula for the capacity of a sealed expanded bag is:{{sfn|Robin|2004}}

<math display="block">V=w^3 \left (h/ \left (\pi w \right ) -0.142 \left (1-10^ \left (-h/w \right ) \right ) \right ),</math>

where ''w'' is the width of the bag (the shorter dimension), ''h'' is the height (the longer dimension), and ''V'' is the maximum volume. The approximation ignores the crimping round the equator of the bag.

A very rough approximation to the capacity of a bag that is open at one edge is:{{Citation needed|date=June 2023}} <math display="block">V=w^3 \left (h/ \left (\pi w \right ) -0.071 \left (1-10^ \left (-2h/w \right ) \right ) \right )</math>

(This latter formula assumes that the corners at the bottom of the bag are linked by a single edge, and that the base of the bag is not a more complex shape such as a [[lens (geometry)|lens]]).{{Citation needed|date=June 2023}}

== The square teabag == [[Image:teabag.jpg|right|thumb|A numerical simulation of an inflated teabag (with crimping smoothed out)]]

For the special case where the bag is sealed on all edges and is square with unit sides, ''h'' = ''w'' = 1, the first formula estimates a volume of roughly

or roughly 0.19. According to Andrew Kepert, a lecturer in mathematics at the [[University of Newcastle, Australia]], an upper bound for this version of the teabag problem is 0.217+, and he has made a construction that appears to give a volume of 0.2055+.{{Citation needed|date=June 2023}}

Robin also found a more complicated formula for the general paper bag,{{sfn|Robin|2004}}{{Specify|reason=What is the formula?|date=June 2023}} which gives 0.2017, below the bounds given by Kepert (i.e., 0.2055+ ≤ maximum volume ≤ 0.217+).

== See also == * [[Biscornu]], a shape formed by attaching two squares in a different way, with the corner of one at the midpoint of the other * [[Mylar balloon (geometry)]]

== Notes== {{reflist}}

== References == * {{cite journal| last=Robin| first=Anthony C| year=2004| title=Paper Bag Problem| journal=[[Institute of Mathematics and its Applications#Mathematics Today|Mathematics Today]]| publisher=[[Institute of Mathematics and its Applications]]| issn=1361-2042 | volume=June| pages=104–107}} * {{cite web |author1=Weisstein, Eric W. |author1-link=Eric W. Weisstein |title=Paper Bag |url=https://mathworld.wolfram.com/PaperBag.html |website=[[MathWorld]] |archive-url=https://web.archive.org/web/20110629050124/https://mathworld.wolfram.com/PaperBag.html |archive-date=2011-06-29 |url-status=dead}}{{Circular reference|date=June 2023}}

== External links == * [http://www.ics.uci.edu/~eppstein/junkyard/teabag.html The original statement of the teabag problem] * [https://web.archive.org/web/20050404002125/http://frey.newcastle.edu.au/~andrew/teabag/ Andrew Kepert's work on the teabag problem (mirror)] * [https://web.archive.org/web/20050616180606/http://frey.newcastle.edu.au/~andrew/teabag/folding/curvedFold.html Curved folds for the teabag problem] * [https://web.archive.org/web/20050410213151/http://www.dse.nl/%7Eandreas/teabag.html A numerical approach to the teabag problem by Andreas Gammel] * {{MathWorld|title=Paper Bag Surface|urlname=PaperBagSurface}}

[[Category:Geometric shapes]] [[Category:Mathematical optimization]]