In this paper, we introduce the comparison number for one feasible solutioncompared with another. With the help of it the comparison-number method for find-ing the major optimal solutions aud major efficient solutions...In this paper, we introduce the comparison number for one feasible solutioncompared with another. With the help of it the comparison-number method for find-ing the major optimal solutions aud major efficient solutions to discrete multiobjectiveprogramming is given.展开更多
In this papers the Fritz John conditions and Kuhn-Tucker conditions for majoroptimal solutions and major efficient solutions of multiobjective programming are givenand proved.
In this paper, weak strictly convex vector function and weak strictly H\-α convex vector function are introduced. We prove the uniqueness of major efficient solution when the objective function is weak strictly c...In this paper, weak strictly convex vector function and weak strictly H\-α convex vector function are introduced. We prove the uniqueness of major efficient solution when the objective function is weak strictly convex vector function, and the uniqueness of α major efficient solution when the objective function is weak strictly H α convex vector function.展开更多
As we know, the Pareto efficient (optimal) solution or in other words, thenoninferior solution, is a basic concept in multiobjective programming. In thesense of this kind of solution, much theoretical and application ...As we know, the Pareto efficient (optimal) solution or in other words, thenoninferior solution, is a basic concept in multiobjective programming. In thesense of this kind of solution, much theoretical and application work has been doneon solutions in multiobjective programming since the 1950s. However, because thePareto efficient solution is only a solution with respect to a vector objective beingnoinnferior, as for a given multiobjective programming problem, its set is large whenthe number of objectives is great. This is an inevitable flaw caused by definingPareto efficient solution with the partial order induced by a positive cone. Yu intro-duced the nondominated solution on the basis of a general convex cone or展开更多
In this papert the theory of major efficiency for multiobjective programmingis established.The major-efficient solutions and weakly major-efficient solutions of multiobjective programming given here are Pareto efficie...In this papert the theory of major efficiency for multiobjective programmingis established.The major-efficient solutions and weakly major-efficient solutions of multiobjective programming given here are Pareto efficient solutions of the same multiobjectiveprogramming problem, but the converse is not true. In a ceratin sense , these solutionsare in fact better than any other Pareto efficient solutions. Some basic theorems whichcharacterize major-efficient solutions and weakly major-efficient solutions of multiobjective programming are stated and proved. Furthermore,the existence and some geometricproperties of these solutions are studied.展开更多
基金Research supported by the National Natural Science Foundation of China.
文摘In this paper, we introduce the comparison number for one feasible solutioncompared with another. With the help of it the comparison-number method for find-ing the major optimal solutions aud major efficient solutions to discrete multiobjectiveprogramming is given.
文摘In this papers the Fritz John conditions and Kuhn-Tucker conditions for majoroptimal solutions and major efficient solutions of multiobjective programming are givenand proved.
文摘In this paper, weak strictly convex vector function and weak strictly H\-α convex vector function are introduced. We prove the uniqueness of major efficient solution when the objective function is weak strictly convex vector function, and the uniqueness of α major efficient solution when the objective function is weak strictly H α convex vector function.
文摘As we know, the Pareto efficient (optimal) solution or in other words, thenoninferior solution, is a basic concept in multiobjective programming. In thesense of this kind of solution, much theoretical and application work has been doneon solutions in multiobjective programming since the 1950s. However, because thePareto efficient solution is only a solution with respect to a vector objective beingnoinnferior, as for a given multiobjective programming problem, its set is large whenthe number of objectives is great. This is an inevitable flaw caused by definingPareto efficient solution with the partial order induced by a positive cone. Yu intro-duced the nondominated solution on the basis of a general convex cone or
文摘In this papert the theory of major efficiency for multiobjective programmingis established.The major-efficient solutions and weakly major-efficient solutions of multiobjective programming given here are Pareto efficient solutions of the same multiobjectiveprogramming problem, but the converse is not true. In a ceratin sense , these solutionsare in fact better than any other Pareto efficient solutions. Some basic theorems whichcharacterize major-efficient solutions and weakly major-efficient solutions of multiobjective programming are stated and proved. Furthermore,the existence and some geometricproperties of these solutions are studied.
