In the author's previous works,a methed of ordinary differential equations forsolving multiobjective programming problem had been presented. In this paper, we further use ordi-nary differential equatfons to discuss the general multiobjective programming Problem and its con-straints more deeply. Under certain conditions, starting from some neibourhood of any feasible solu-tion of multiobjective programming problem, along the trajectory of the established system of ordi-nary differential equations,the solution is always conversent to the(weak)efficient solution of theoriginal multiobjective programming problem with respect to partial arguments.