For a given system, by using the Tkachev method which concerned with the proof of the stability of a multiple limit cycle, the exact computation formula of the third separatrix values named by Leontovich for the multi...For a given system, by using the Tkachev method which concerned with the proof of the stability of a multiple limit cycle, the exact computation formula of the third separatrix values named by Leontovich for the multiple limit cycle bifurcation was given, which was one of the main criterions for the number of limit cycles bifurcated from a homoclinic orbit and the stability of the homoclinic loop, and a computation formula for higher separatrix values was conjectured.展开更多
In this paper, optimality conditions for multiobjective programming problems having V-invex objective and constraint functions are considered. An equivalent multiobjective programming problem is constructed by a modif...In this paper, optimality conditions for multiobjective programming problems having V-invex objective and constraint functions are considered. An equivalent multiobjective programming problem is constructed by a modification of the objective function.Furthermore, a (α, η)-Lagrange function is introduced for a constructed multiobjective programming problem, and a new type of saddle point is introduced. Some results for the new type of saddle point are given.展开更多
文摘For a given system, by using the Tkachev method which concerned with the proof of the stability of a multiple limit cycle, the exact computation formula of the third separatrix values named by Leontovich for the multiple limit cycle bifurcation was given, which was one of the main criterions for the number of limit cycles bifurcated from a homoclinic orbit and the stability of the homoclinic loop, and a computation formula for higher separatrix values was conjectured.
基金Supported by the National Natural Science Foundation of China(19871009)
文摘In this paper, optimality conditions for multiobjective programming problems having V-invex objective and constraint functions are considered. An equivalent multiobjective programming problem is constructed by a modification of the objective function.Furthermore, a (α, η)-Lagrange function is introduced for a constructed multiobjective programming problem, and a new type of saddle point is introduced. Some results for the new type of saddle point are given.
