INTERNATIONAL TRADE AND MATHEMATICAL PROGRAMMING

T. Takayama

Australian Journal of Agricultural Economics, 1967, vol. 11, issue 01, 13

Abstract: 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.

Keywords: International; Relations/Trade (search for similar items in EconPapers)
Date: 1967
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (7)

Downloads: (external link)
https://ageconsearch.umn.edu/record/22342/files/11010036.pdf (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:ags:ajaeau:22342

DOI: 10.22004/ag.econ.22342

Access Statistics for this article

More articles in Australian Journal of Agricultural Economics from Australian Agricultural and Resource Economics Society Contact information at EDIRC.
Bibliographic data for series maintained by AgEcon Search ().