共查询到20条相似文献,搜索用时 453 毫秒
1.
Zhe Chen 《Applicable analysis》2013,92(12):2457-2467
In this article, we investigate the nonemptiness and compactness of the weak Pareto optimal solution set of a multiobjective optimization problem with functional constraints via asymptotic analysis. We then employ the obtained results to derive the necessary and sufficient conditions of the weak Pareto optimal solution set of a parametric multiobjective optimization problem. Our results improve and generalize some known results. 相似文献
2.
In this paper, we introduce a sequential approximate strong Karush–Kuhn–Tucker (ASKKT) condition for a multiobjective optimization problem with inequality constraints. We show that each local efficient solution satisfies the ASKKT condition, but weakly efficient solutions may not satisfy it. Subsequently, we use a so-called cone-continuity regularity (CCR) condition to guarantee that the limit of an ASKKT sequence converges to an SKKT point. Finally, under the appropriate assumptions, we show that the ASKKT condition is also a sufficient condition of properly efficient points for convex multiobjective optimization problems. 相似文献
3.
《Optimization》2012,61(1-4):369-385
In this paper, we are concerned with global efficiency in multiobjective optimization. After exposing a property of a cone-subconvexlike function, we prove that a local weakly efficient solution, a local efficient solution and a local properly efficient solution are respectively a global weakly efficient solution, a global efficient solution and a global properly efficient solution of a multiobjective programming problem if cone- subconvexlikeness or cone-pre-invexity is assumed 相似文献
4.
We use asymptotic analysis to develop finer estimates for the efficient, weak efficient and proper efficient solution sets (and for their asymptotic cones) to convex/quasiconvex vector optimization problems. We also provide a new representation for the efficient solution set without any convexity assumption, and the estimates involve the minima of the linear scalarization of the original vector problem. Some new necessary conditions for a point to be efficient or weak efficient solution for general convex vector optimization problems, as well as for the nonconvex quadratic multiobjective optimization problem, are established. 相似文献
5.
锥上半连续锥拟凸集值映射多目标优化超有效解集的连通性 总被引:1,自引:0,他引:1
本文研究集值映射多目标优化超有效解集的连通性,在目标映射为锥上半连续和锥拟凸的条件下,证明了其超有效解集是连通的. 相似文献
6.
ABSTRACTThe aim of this paper is to obtain the range set for a given multiobjective linear programming problem and a weakly efficient solution. The range set is the set of all values of a parameter such that a given weakly efficient solution remains efficient when the objective coefficients vary in a given direction. The problem was originally formulated by Benson in 1985 and left to be solved. We formulate an algorithm for determining the range set, based on some hard optimization problems. Due to toughness of these optimization problems, we propose also lower and upper bound approximation techniques. In the second part, we focus on topological properties of the range set. In particular, we prove that a range set is formed by a finite union of intervals and we propose upper bounds on the number of intervals. Our approach to tackle the range set problem is via the intersection problem of parametric polytopes. Thus, our results have much wider area of applicability since the intersection (and separability) problem of convex polyhedra is important in many fields of optimization. 相似文献
7.
Multiobjective optimization is a useful mathematical model in order to investigate real-world problems with conflicting objectives, arising from economics, engineering, and human decision making. In this paper, a convex composite multiobjective optimization problem, subject to a closed convex constraint set, is studied. New first-order optimality conditions for a weakly efficient solution of the convex composite multiobjective optimization problem are established via scalarization. These conditions are then extended to derive second-order optimality conditions. 相似文献
8.
Shouyang Wang 《Applied Mathematics Letters》1991,4(6):91-93
In this short paper, we give a result on scalarization of multiobjective optimization. Any local weakly efficient solution of a multiobjective programming problem is a locally optimal solution of the corresponding weighted optimization problem if and only if one of the three conditions proposed in this paper is satisfied. 相似文献
9.
In this note, we present a geometrical characterization of the set of weakly efficient points in constrained convex multiobjective optimization problems, valid for a compact set of objectives. 相似文献
10.
In this paper by employing an asymptotic approach we develop an existence and stability theory for convex multiobjective programming. We deal with the set of weakly efficient minimizers. To this end we employ a notion of convergence for vector-valued functions close to that due to Lemaire. 相似文献
11.
《European Journal of Operational Research》2001,133(2):267-286
In this paper, we consider an optimization problem which aims to minimize a convex function over the weakly efficient set of a multiobjective programming problem. From a computational viewpoint, we may compromise our aim by getting an approximate solution of such a problem. To find an approximate solution, we propose an inner approximation method for such a problem. Furthermore, in order to enhance the efficiency of the solution method, we propose an inner approximation algorithm incorporating a branch and bound procedure. 相似文献
12.
无限维空间拟凸映射多目标最优化问题解集的连通性 总被引:10,自引:1,他引:10
本文在一个无限格中引入了拟凸、强拟凸和严格拟凸映射。并在约束集为紧凸条件下,证明了相应的多目标规划问题之有效解集和弱有效解集连通性结果。 相似文献
13.
14.
15.
Jiawei Chen La Huang Shengjie Li 《Journal of Optimization Theory and Applications》2018,178(3):794-823
In this paper, we investigate the separations and optimality conditions for the optimal solution defined by the improvement set of a constrained multiobjective optimization problem. We introduce a vector-valued regular weak separation function and a scalar weak separation function via a nonlinear scalarization function defined in terms of an improvement set. The nonlinear separation between the image of the multiobjective optimization problem and an improvement set in the image space is established by the scalar weak separation function. Saddle point type optimality conditions for the optimal solution of the multiobjective optimization problem are established, respectively, by the nonlinear and linear separation methods. We also obtain the relationships between the optimal solution and approximate efficient solution of the multiobjective optimization problem. Finally, sufficient and necessary conditions for the (regular) linear separation between the approximate image of the multiobjective optimization problem and a convex cone are also presented. 相似文献
16.
In this paper, we study Henig weakly efficient solutions for set-valued optimization problems. The connectedness of the Henig
weakly efficient solution set is proved under the condition that the objective function be a cone-arcwise connected set-valued
mapping. As an application of the result, we establish the connectedness of the set of super efficient solutions. 相似文献
17.
X. X. Huang X. Q. Yang K. L. Teo 《Journal of Optimization Theory and Applications》2004,123(2):391-407
In this paper, we characterize the nonemptiness and compactness of the set of weakly efficient solutions of a convex vector optimization problem with cone constraints in terms of the level-boundedness of the component functions of the objective on the perturbed sets of the original constraint set. This characterization is then applied to carry out the asymptotic analysis of a class of penalization methods. More specifically, under the assumption of nonemptiness and compactness of the weakly efficient solution set, we prove the existence of a path of weakly efficient solutions to the penalty problem and its convergence to a weakly efficient solution of the original problem. Furthermore, for any efficient point of the original problem, there exists a path of efficient solutions to the penalty problem whose function values (with respect to the objective function of the original problem) converge to this efficient point. 相似文献
18.
19.
In this paper the Pareto efficiency of a uniformly convergent multiobjective optimization sequence is studied. We obtain some relation between the Pareto efficient solutions of a given multiobjective optimization problem and those of its uniformly convergent optimization sequence and also some relation between the weak Pareto efficient solutions of the same optimization problem and those of its uniformly convergent optimization sequence. Besides, under a compact convex assumption for constraints set and a certain convex assumption for both objective and constraint functions, we also get some sufficient and necessary conditions that the limit of solutions of a uniformly convergent multiobjective optimization sequence is the solution of a given multiobjective optimization problem. 相似文献
20.
无限维空间中强拟凸向量优化问题有效解集的连通性 总被引:3,自引:0,他引:3
本文在无穷维空间引进增强凸变换的概念,在约束集是紧和凸的条件下目标函数是连续和强拟凸的,我们得取到向量极小问题有效解集的连通性。 相似文献