In this paper an attempt is made to formulate one type of international trade problem within a class of mathematical programming models. A new approach--from the dual side--to the proofs of existence and characteristics of the solution of the Koopmans-Hitchcock transportation cost minimization linear programming problem is presented, and the same approach is applied to the quadratic programming formulation of the problem.