【正文】
G7 which are listed in the second, third places, and the G5 and G6, in the sixth and seventh respectively.Accordingly and by bining with the 5 sorting results from above schemes, among the sorting results, ①②④ all have the outes G7G1 (G7 is more important than G1), while ③ has the contrary result: G1G7, which can also support that the sorting results ing from adding convex bination have significant difference from that of the other schemes, this result is attached with irrationality and should be removed. Meanwhile, in the results ①②④, ② and ④ both show G5G6, only ① shows G6G5, so that ① should be removed likewise. Therefore this paper supposes that the reasonable sorting scheme is:The abandon of sorting scheme ① and ③ is the discard of undirected connected graph and convex bination in this matrix aggregation essentially。 Optimization1 IntroductionAs an effective method utilized in multiobjective and multifactor decision making, Analytic Hierarchy Process has been widely applied in many decision making aspects. It normally involves several decision makers, therefore, multiple judgment matrixes provided by different decision maker need to be aggregated so that to reach a more reasonable solution. In the field of matrix aggregation, Lv Yuejin and Guo Xinrong utilized the Connected Undirected Graph and its theories, by excluding the biased expert judgments, have e up with a reciprocal judgment matrix aggregation method which was oriented from the theory of mth power graph of simple undirected connected graph [1]. Nevertheless,Liu Xin and Yang Shanlin developed Hadamard convex bination based on judgment matrix [23], provided the evidence on “additive”and“multiplicative” convex binations consistency improvement as well. The document [4] has studied on the optimization principle related with the convex coefficients of judgment matrix, and provided solution to the convex bination coefficients of judgment matrix.Different matrix aggregation schemes will process the expert judgment data with discrepancy and aggregation results of judgment matrix are produced differently, therefore the weight and consistency after calculation are differential from another. While, in the process of matrix aggregation, the same aggregation schemes also present discrepantly in different judgment matrix aggregation. In the practice of solving problems, it is necessary to adopt different matrix aggregation methods and implement relevant verification and choice. This paper will investigate the feasibility and problems of matrix aggregation schemes that are initiated from graph theory and Hadamard convex binations, andrelevant verification, optimizing and choice have been made.2 The Description of Matrix Aggregation Method The Solution of Matrix Aggregation Method Based on Graph TheoryMatrix aggregation solution based on graph theory, is to set up a level deviation matrix E, and select more consistent factors from the different expert judgment matrix A(k), so as to construct a plete consistent judgment matrix A*. The detailed construction steps and explanation see document [1].Step1: Setting up the expert judgment matrix with consistency A1Am;Step2: Setting up the grade deviation matrix in decisionmaking process,