The authors of this article are interested in characterization of efficient solutions for special classes of problems. These classes consider semi-strong E-convexity of involved functions. Sufficient and necessary con...The authors of this article are interested in characterization of efficient solutions for special classes of problems. These classes consider semi-strong E-convexity of involved functions. Sufficient and necessary conditions for a feasible solution to be an efficient or properly efficient solution are obtained.展开更多
Several equivalent statements of generalized subconvexlike set-valued map are established in ordered linear spaces. Using vector closure, we introduce Benson proper efficient solution of vector optimization problem. U...Several equivalent statements of generalized subconvexlike set-valued map are established in ordered linear spaces. Using vector closure, we introduce Benson proper efficient solution of vector optimization problem. Under the assumption of generalized subconvexlikeness, scalarization, multiplier and saddle point theorems are obtained in the sense of Benson proper efficiency.展开更多
In this paper we characterize the proper efficient solution of a mul-tiobjective programming problem(P)in terms of the saddle point criterion of anew problem(S)and establish a pair of dual problems(S_α)and(D_α)in or...In this paper we characterize the proper efficient solution of a mul-tiobjective programming problem(P)in terms of the saddle point criterion of anew problem(S)and establish a pair of dual problems(S_α)and(D_α)in order todecide the proper efficient solution by the strong duality.We also give methodof characterization in terms of the saddle point criterion of(P).Finally,we provethat every efficient solution of the matrix linear programming problem is a properefficient solution.展开更多
This paper offers a characterization method for the proper efficient solution ofthe multiobjective programming problem in terms of the proper saddle point and proves anecessary and sufficient condition for the equival...This paper offers a characterization method for the proper efficient solution ofthe multiobjective programming problem in terms of the proper saddle point and proves anecessary and sufficient condition for the equivalence between the proper efficient solutionand the associated proper saddle point by using the duality of a pair of problems.展开更多
In this paper,we study the connectedness of proper efficient solution sets of the vector optimization problem for a strict cone--quasiconvex mapping in a separated topological linear space.
In this paper, we investigate the connectedness of G-proper efficient solution set for multiobjective programming problem. It is shown that the G-proper efficient solution set is connected if objective functions are c...In this paper, we investigate the connectedness of G-proper efficient solution set for multiobjective programming problem. It is shown that the G-proper efficient solution set is connected if objective functions are convex. A sufficient condition for the connectedness of G-proper efficient solution set is established when objective functions are strictly quasiconvex.展开更多
In this article, a novel scalarization technique, called the improved objective-constraint approach, is introduced to find efficient solutions of a given multiobjective programming problem. The presented scalarized pr...In this article, a novel scalarization technique, called the improved objective-constraint approach, is introduced to find efficient solutions of a given multiobjective programming problem. The presented scalarized problem extends the objective-constraint problem. It is demonstrated that how adding variables to the scalarized problem, can lead to find conditions for (weakly, properly) Pareto optimal solutions. Applying the obtained necessary and sufficient conditions, two algorithms for generating the Pareto front approximation of bi-objective and three-objective programming problems are designed. These algorithms are easy to implement and can achieve an even approximation of (weakly, properly) Pareto optimal solutions. These algorithms can be generalized for optimization problems with more than three criterion functions, too. The effectiveness and capability of the algorithms are demonstrated in test problems.展开更多
文摘The authors of this article are interested in characterization of efficient solutions for special classes of problems. These classes consider semi-strong E-convexity of involved functions. Sufficient and necessary conditions for a feasible solution to be an efficient or properly efficient solution are obtained.
文摘Several equivalent statements of generalized subconvexlike set-valued map are established in ordered linear spaces. Using vector closure, we introduce Benson proper efficient solution of vector optimization problem. Under the assumption of generalized subconvexlikeness, scalarization, multiplier and saddle point theorems are obtained in the sense of Benson proper efficiency.
文摘In this paper we characterize the proper efficient solution of a mul-tiobjective programming problem(P)in terms of the saddle point criterion of anew problem(S)and establish a pair of dual problems(S_α)and(D_α)in order todecide the proper efficient solution by the strong duality.We also give methodof characterization in terms of the saddle point criterion of(P).Finally,we provethat every efficient solution of the matrix linear programming problem is a properefficient solution.
基金Project supported by the National Natural Science Foundation of China.
文摘This paper offers a characterization method for the proper efficient solution ofthe multiobjective programming problem in terms of the proper saddle point and proves anecessary and sufficient condition for the equivalence between the proper efficient solutionand the associated proper saddle point by using the duality of a pair of problems.
文摘In this paper,we study the connectedness of proper efficient solution sets of the vector optimization problem for a strict cone--quasiconvex mapping in a separated topological linear space.
基金This work is supported by Research Foundation of the Education Departm entof Zhejiang Province(2 0 0 10 2 80 )
文摘In this paper, we investigate the connectedness of G-proper efficient solution set for multiobjective programming problem. It is shown that the G-proper efficient solution set is connected if objective functions are convex. A sufficient condition for the connectedness of G-proper efficient solution set is established when objective functions are strictly quasiconvex.
文摘In this article, a novel scalarization technique, called the improved objective-constraint approach, is introduced to find efficient solutions of a given multiobjective programming problem. The presented scalarized problem extends the objective-constraint problem. It is demonstrated that how adding variables to the scalarized problem, can lead to find conditions for (weakly, properly) Pareto optimal solutions. Applying the obtained necessary and sufficient conditions, two algorithms for generating the Pareto front approximation of bi-objective and three-objective programming problems are designed. These algorithms are easy to implement and can achieve an even approximation of (weakly, properly) Pareto optimal solutions. These algorithms can be generalized for optimization problems with more than three criterion functions, too. The effectiveness and capability of the algorithms are demonstrated in test problems.
