A hierarchical satisfying optimal algorithm incorporating different importance and preemptive priorities is formulated. With the priority structure given by the decision-maker in the constrained multi-objective multi-...A hierarchical satisfying optimal algorithm incorporating different importance and preemptive priorities is formulated. With the priority structure given by the decision-maker in the constrained multi-objective multi-degree-of-freedom optimization (CMMO) problem, the commonly used quadratic programming model is converted into a two-level optimization problem solved by the tolerant lexicographic method and the varying-domain optimization method. In contrast to previous works, the proposed approach allows the decision-maker to determine a desirable achievement degree for each goal to reflect explicitly the relative importance of these goals. The resulting solutions satisfy both the preemptive priority structure and have the maximum achievement degrees in sum. The power of the proposed approach is demonstrated with an example.展开更多
Constrained multi_objective multi_degree_of_freedom optimization (CMMO) is proposed from the application background of optimization control for complex industrial processes. CMMO is formulated as a QP problem. Through...Constrained multi_objective multi_degree_of_freedom optimization (CMMO) is proposed from the application background of optimization control for complex industrial processes. CMMO is formulated as a QP problem. Through transforming it into a linear complementary programming problem with parameters, the formulas for right and left sided sensitivity are obtained. Based on them, the objective coordination method for CMMO is developed.展开更多
文摘A hierarchical satisfying optimal algorithm incorporating different importance and preemptive priorities is formulated. With the priority structure given by the decision-maker in the constrained multi-objective multi-degree-of-freedom optimization (CMMO) problem, the commonly used quadratic programming model is converted into a two-level optimization problem solved by the tolerant lexicographic method and the varying-domain optimization method. In contrast to previous works, the proposed approach allows the decision-maker to determine a desirable achievement degree for each goal to reflect explicitly the relative importance of these goals. The resulting solutions satisfy both the preemptive priority structure and have the maximum achievement degrees in sum. The power of the proposed approach is demonstrated with an example.
文摘Constrained multi_objective multi_degree_of_freedom optimization (CMMO) is proposed from the application background of optimization control for complex industrial processes. CMMO is formulated as a QP problem. Through transforming it into a linear complementary programming problem with parameters, the formulas for right and left sided sensitivity are obtained. Based on them, the objective coordination method for CMMO is developed.
