Let p = ( p 1 ,…, p n ) be a vector of positive integers whose greatest common divisor is unity. The Frobenius problem is to ﬁnd the largest integer f * which cannot be written as a non-negative integral combination of the p i . In this note we relate the Frobenius problem to the topic of maximal lattice free bodies and describe an algorithm for n = 3.
Scarf, Herbert E. and Shallcross, David F., "The Frobenius Problem and Maximal Lattice Free Bodies" (1990). Cowles Foundation Discussion Papers. 1188.