3.2 Global optimization

3.2.1 Multi-objective (MO) problem

A multi-objective problem can be described as to seek for an ideal set ofparameter that is able to minimize or maximize the objective vector.The formula of the objective function can be described as follows：

where x is the input decision variable vector; y is the objective vector; gj (x)is the constrains; S is the feasible solution domain.Assuming that there aretwo parameters in an objective function named u andv.If fi(u)≤fi(v) (i=1，2，…，m)，and at least one of the inequality equation is valid，then u dominates v.If x′∈S，and no other dominants can be found in vectorx，then x′ willbe defined as the Pareto optimal of multi-objectives.A Pareto front is a set ofsolutions where there doesn’t exit another dominant of either objective.Cert ......     （共9482字）    [阅读本文]>>