This paper presents a method for the inverse fractional matching problem. W
e show that the dual of this inverse problem can be transformed into the ci
rculation flow problem on a directed bipartite graph which can be solved ea
sily. We also give an algorithm to obtain the primal optimum solution of th
e inverse problem from its dual optimum solution by solving a shortest path
problem. Furthermore, we generalize this method to solve the inverse symme
tric transportation problem.