Two Multi-objective Programming Question Research Based On The Kuhn-Tucker Condition

There are a lot of hierarchical decision-making systems in the field of economic management,which can be abstracted into multi-level optimization models.Bi-level optimization problem is a basic form of hierarchical multi-level optimization problems. Because time are many each policy-maker's objective function continues,two multi-objective programming questions have been put forward.So far,two multi-objective programming question has not been deeply researched,and the calculation methods are not effective.Calculation methods for the two multi-objective programming methods are researched based on summarizing relative theory in the paper, the main content as follows:It contains many decision makers,each of them has more than one object bi-level multi objective decision making.An algorithm is given to solve a mathematical model of bi-level multi objective decision making.Via connecting linear plus power module ideal point algorithm under Kuhn-Tucker condition,the bi-level multi objective programming problem is changed to a singular-level singular-objective constraint programming problem.Then the efficient so-lution of the problem can be aquired.This method is fast,iconvenient,simplify operation,what obtains through the example is policy-maker's satisfaction effective solution.