Vizvári, B.2016-02-082016-02-0819930031-5303http://hdl.handle.net/11693/26032Let a1, a2, ..., an be relative prime positive integers. The Frobenius problem is to determine the greatest integer not belonging to the set {Σj=1 najxj :x∈Z+ n}. The Frobenius problem belongs to the combinatorial number theory, which is very rich in methods. In this paper the Frobenius problem is handled by integer programming which is a new tool in this field. Some new upper bounds and exact solutions of subproblems are provided. A lot of earlier results obtained with very different methods can be discussed in a unified way.EnglishFrobenius problemGreedy solutionInteger programingArticle10.1007/BF018766321588-2829