In this paper，the sufficient and necessary condition of the existence theorems for (g,f)-matchings and f-factors of bipartite graphs and several related results are proved. We give the algorithms to solve the maximum (g,f)-matching，the minimum (g,f)-matching，the minimum weighted maximum f-matching，the minimum weighted (g,f)-matching and the maximum weighted (g,f)-matching of bipartite graphs.