This paper is concerned with the Pareto solution set of multiobjective optimization problem with unconstrain, in which the objective functions functions are C1.

Results indicate that this method can obtain uniformly distributed Pareto-optimal solutions.

The numerical experiments show that this algorithm can find more and wider Pareto-optimal solutions than the original one.

Aim It is desirable to find more Pareto-optimal solutions which scattered uniformly over Pareto-front in solving multiobjective programming.

The optimal equilibrium solutions set is a connected convex set consisting of the Pareto optimal solutions in a certain convex condition.

This is a multi-objective optimization problem, so a set of Pareto optimal solutions have to be sought.

Thus how to find a sufficient number of uniformly distributed and representative Pareto optimal solutions under the condition of the continuously changing time for the decision maker is very important.

To solve the problem of ignored product quality in cost-tolerance model,a multi-objective model of tolerance design was presented,which was based on Taguchi's quality view and the conception of Pareto optimum set.

The relationship between general equilibrium and the pareto optimum in private ownership economy system is discussed with the method of constructing mathematic model and proved with the method of the first and second welfare theorems of private ownership economy.

With the help of the gaming analysis and based on the small-world optimization algorithm,it tries to find a QoS unicast path with the Pareto optimum under the Nash equilibrium on both the network provider utility and the user utility achieved or approached.