期刊文献+
共找到6篇文章
< 1 >
每页显示 20 50 100
CHARACTERIZATION OF EFFICIENT SOLUTIONS FOR MULTI-OBJECTIVE OPTIMIZATION PROBLEMS INVOLVING SEMI-STRONG AND GENERALIZED SEMI-STRONG E-CONVEXITY 被引量:5
1
作者 E.A.Youness Tarek Emam 《Acta Mathematica Scientia》 SCIE CSCD 2008年第1期7-16,共10页
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. 展开更多
关键词 Multi-objective optimization problems semi-strong E-convex efficient solutions properly efficient solutions
下载PDF
A FLEXIBLE OBJECTIVE-CONSTRAINT APPROACH AND A NEW ALGORITHM FOR CONSTRUCTING THE PARETO FRONT OF MULTIOBJECTIVE OPTIMIZATION PROBLEMS
2
作者 N.HOSEINPOOR M.GHAZNAVI 《Acta Mathematica Scientia》 SCIE CSCD 2024年第2期702-720,共19页
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. 展开更多
关键词 multiobjective optimization Pareto front SCALARIZATION objective-constraint approach proper efficient solution
下载PDF
Benson proper efficiency for vector optimization of generalized subconvexlike set-valued maps in ordered linear spaces 被引量:2
3
作者 周志昂 《Journal of Shanghai University(English Edition)》 CAS 2010年第5期374-379,共6页
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. 展开更多
关键词 set-valued maps vector closure generalized subconvexlikeness Benson proper efficient solution
下载PDF
The Connectedness of the Proper Efficient Solution Sets of the Vector Optimization Problem for a Strict Cone-quasiconvex Mapping
4
作者 QIU Qiusheng Department of Mathematics and Physics,Wuyi University,Jiangmen,Guangdong,529020 《Systems Science and Systems Engineering》 CSCD 1998年第2期84-89,共6页
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.
关键词 efficient point proper efficient solution base strict cone quasiconvex mapping connectedness.
原文传递
ON MULTIOBJECTIVE FRACTIONAL PROGRAMS
5
作者 Zeng RenyingDept.of Math.and Statist.,University of Regina,Canada 《Applied Mathematics(A Journal of Chinese Universities)》 SCIE CSCD 2000年第2期220-224,共5页
In this paper some optimality criteria are proved and some Mond\|Weir type duality theorem for multiobjective fractional programming problems defined in a Banach space is obtained.
关键词 Strictly invex weak efficient solution Geoffrion proper efficient solution Mond\|Weir duality.
全文增补中
Optimality and Duality for Nondifferentiable Multiple-Objective Optimization with Generalized Univexity
6
作者 ZHOU Hou-chun 1, QIU Yong-ping 21.Department of Mathematics, Shandong Linyi Teacher′s College, Shandong 276005, China2.Department of Mathematics, Shandong Jinan Educational College, Jinan 250002, China 《Journal of Systems Science and Systems Engineering》 SCIE EI CSCD 2001年第2期162-172,共11页
Using generalized univex functions, a nondifferentiable multiple-objective optimization problem is considered.Kuhn-Tucker type sufficient optimality conditions are obtained for a feasible point to be an efficient or p... Using generalized univex functions, a nondifferentiable multiple-objective optimization problem is considered.Kuhn-Tucker type sufficient optimality conditions are obtained for a feasible point to be an efficient or properly efficient solution. Mond-Weir type duality programming is constructed,the weak and strong duality theorems are proved. 展开更多
关键词 multiple-objective optimization efficient solutions properly efficient solutions
原文传递
上一页 1 下一页 到第
使用帮助 返回顶部