Integer Programming Formulations For The Frobenius Problem

The Frobenius number of a set of relatively prime positive integers α1,α2,…,αn such that α1< α2< …< αn, is the largest integer that can not be written as a nonnegative integer linear combination of the given set. Finding the Frobenius number is known as the Frobenius problem, which is also named as the coin exchange problem or the postage stamp problem. This problem is closely related with the equality constrained integer knapsack problem. It is known that this problem is NP-hard. Extensive research has been conducted for finding the Frobenius number of a given set of positive integers. An exact formula exists for the case n=2 and various formulas have been derived for all special cases of n = 3. Many algorithms have been proposed for n≥4. As far as we are aware, there does not exist any integer programming approach for this problem which is the main motivation of this paper. We present four integer linear programming formulations about the Frobenius number of a given set of positive integers. Our first formulation is used to check if a given positive integer is the Frobenius number of a given set of positive integers. The second formulation aims at finding the Frobenius number directly. The third formulation involves the residue classes with respect to the least member of the given set of positive integers, where a residue table is computed comprising all values modulo that least member, and the Frobenius number is obtained from there. Based on the same approach underlying the third formulation, we propose our fourth formulation which produces the Frobenius number directly. We demonstrate how to use our formulations with several examples. For illustrative purposes, some computa-tional analysis is also presented.