Homotopy Method For Solving Bilevel Multiobjective Programming Problems

Double multi-objective programming problems, namely, to participate in the decision more than one person, every decision makers target function more than one, policymakers, the relationship between decision and the role and position in the different also. Such a combination between policy makers hierarchical relationship between the second floor of the system. This system mainly divided into three kinds of situations that contain double is a target, the existence of a single goal, a layer of the goal, and that is the double target.In recent years, due to the double multi-objective programming in the actual application, solving method also get the rapid development. This article in view of the complex of the target for the circumstances are, by constructing the homotopy equation to find solution of the equivalent condition, and combined with the NCP smooth proposed in common law cone function under the condition of solving the problem of equivalence, will more than double the goal programming problem into a single with equality constraints programming, and then by combined homotopy method under mild conditions for solving, and prove the existence of the path with Aaron range of convergence.