首页 | 本学科首页   官方微博 | 高级检索  
相似文献
 共查询到19条相似文献,搜索用时 109 毫秒
1.
群体多目标决策联合有效解类的几个最优性充分条件   总被引:6,自引:1,他引:5  
对于群体多目标决策问题,文献[1]利用供选方案的有效数引进一类基本的联合有效解概念,并且给出了此类解要满足的最优性必要条件。本文在一定凸性要求下,建立了群体多目标决策问题联合有效解类的若干最优性充分条件。  相似文献   

2.
对于群体多目标规划问题,文[1]和[2]分别引进了它的联合有效解类和带参数α的α-较多联合有效解类,并且建立了这些解类的最优性条件.文[3]则研究了联合有效解类的几何特性.本文借助供选方案集的带两个参数α和β的αβ-较多有效数,定义了群体多目标规划问题的更一般的αβ-较多联合有效解类,并且研究了这些解的几何特性,得到了若干必要条件和充分条件.  相似文献   

3.
给出了弧式连通凸锥优化问题的强有效解和Benson真有效解的最优性条件,讨论了目标函数和约束函数均为广义弧式连通凸锥函数优化问题的近似有效解的最优性条件,给出了相应的近似Mond-Weir型对偶模型,给出了弱对偶和逆对偶定理.  相似文献   

4.
在Banach空间中,给出了含参数的单值映射的不变类凸,拟不变类凸和伪不变类凸的概念.在这类较弱凸性条件下,提出了参数优化问题弱有效解的几个最优性充分条件.作为应用,研究了一类状态约束最优控制问题的弱最优控制.  相似文献   

5.
求文根据文[1]的启示,作者给出了可行方向的定义,#证了拟凸函数可行方向的一些结论,亦给出了超拟凸函数可行方向的刻画,这些结论在研讨目标函数或约束函数具拟凸类函数的规划问题的最优性条件时是有用的.  相似文献   

6.
周轩伟 《应用数学》2016,29(4):902-909
本文研究较多约束多目标规划的最优性条件.借助于所给问题的较多约束集结构表示,定义了较多约束规划问题的较多约束Pareto有效解和较多约束Pareto弱有效解,给出较多约束Pareto有效解和较多约束Pareto弱有效解要满足的Fritz John条件和Kuhn-Tucker条件,最后给出在凸性条件下它的一些最优性充分条件.  相似文献   

7.
孔翔宇  刘三阳 《应用数学》2020,33(3):634-642
本文研究鲁棒凸优化问题拟近似解的最优性条件和对偶理论.首先利用鲁棒优化方法,在由约束函数的共轭函数的上图给出的闭凸锥约束规格条件下,建立了拟近似解的最优性充要条件.其次给出了鲁棒凸优化问题拟近似解在Wolf型和Mond-weir型对偶模型下的强(弱)对偶定理.最后给出具体实例验证了本文获得的结果.  相似文献   

8.
向量映射的鞍点和Lagrange对偶问题   总被引:4,自引:0,他引:4  
本文研究拓扑向量空间广义锥-次类凸映射向量优化问题的鞍点最优性条件和Lagrange对偶问题,建立向量优化问题的Fritz John鞍点和Kuhn-Tucker鞍点的最优性条件及其与向量优化问题的有效解和弱有效解之间的联系。通过对偶问题和向量优化问题的标量化刻画各解之间的关系,给出目标映射是广义锥-次类凸的向量优化问题在其约束映射满足广义Slater约束规格的条件下的对偶定理。  相似文献   

9.
Barbu等人在文[1]中时目标函数和约束算子都是Frechet可微的情况下证明了具有算子约束的数学规划的最优性必要条件.本文将这一问题推广为目标函数为非光滑的情形,给出了具有算子约束的Lipschitz规划的最优性充分条件和必要条件.  相似文献   

10.
带离散不等式约束的LQ最优控制   总被引:1,自引:0,他引:1  
在笔者文[1]中,我们给出了一类实抽象Hilbert空间中对状态变量x和控制变量u带有线性等式约束或带有凸约束并具有二次型代价指标的有限时域线性控制过程最优解(x~*,u~*)的存在唯一性定理及特征性定理,证明了两类约束条件下的最优解分别是Hilbert空间中插值样条函数和凸集上的样条函数。在笔者的文[2]中,又对实Hilbert函  相似文献   

11.
群体多目标决策联合有效解类的几何特性   总被引:2,自引:0,他引:2  
群体多目标决策是群体决策和多目标决策的一个交叉研究领域,借助供选方案的有效数,文[1]引进了群体多目标决策问题的联合有效解类概念,并且建立了这些解类的K-T最优条件,本文研究这类解的几何特性,得到若干基本的必要条件一充分条件。  相似文献   

12.
《Optimization》2012,61(5):489-503
We introduce a notion of a second-order invex function. A Fréchet differentiable invex function without any further assumptions is second-order invex. It is shown that the inverse claim does not hold. A Fréchet differentiable function is second-order invex if and only if each second-order stationary point is a global minimizer. Two complete characterizations of these functions are derived. It is proved that a quasiconvex function is second-order invex if and only if it is second-order pseudoconvex. Further, we study the nonlinear programming problem with inequality constraints whose objective function is second-order invex. We introduce a notion of second-order type I objective and constraint functions. This class of problems strictly includes the type I invex ones. Then we extend a lot of sufficient optimality conditions with generalized convex functions to problems with second-order type I invex objective function and constraints. Additional optimality results, which concern type I and second-order type I invex data are obtained. An answer to the question when a kernel, which is not identically equal to zero, exists is given.  相似文献   

13.
In this paper we obtain first and second-order optimality conditions for an isolated minimum of order two for the problem with inequality constraints and a set constraint. First-order sufficient conditions are derived in terms of generalized convex functions. In the necessary conditions we suppose that the data are continuously differentiable. A notion of strongly KT invex inequality constrained problem is introduced. It is shown that each Kuhn-Tucker point is an isolated global minimizer of order two if and only if the problem is strongly KT invex. The article could be considered as a continuation of [I. Ginchev, V.I. Ivanov, Second-order optimality conditions for problems with C1 data, J. Math. Anal. Appl. 340 (2008) 646-657].  相似文献   

14.
研究了一个非光滑半无限多目标优化问题(简记为SIMOP),并讨论了它的最优性条件.首先, 通过对目标函数和约束函数的某种组合赋予Clarke F-凸性假设, 获得了SIMOP(弱)有效解的最优性充分条件.接下来, 用Chankong-Haimes方法建立了此SIMOP的一个标量问题并得到了这个标量问题的最优性充分条件.  相似文献   

15.
《Optimization》2012,61(2):239-253
An invex constrained nonsmooth optimization problem is considered, in which the presence of an abstract constraint set is possibly allowed. Necessary and sufficient conditions of optimality are provided and weak and strong duality results established. Following Geoffrion’s approach an invex nonsmooth alternative theorem of Gordan type is then derived. Subsequently, some applications on multiobjective programming are then pursued  相似文献   

16.
In this paper, we study the Karush–Kuhn–Tucker optimality conditions in a class of nonconvex optimization problems with an interval-valued objective function. Firstly, the concepts of preinvexity and invexity are extended to interval-valued functions. Secondly, several properties of interval-valued preinvex and invex functions are investigated. Thirdly, the KKT optimality conditions are derived for LU-preinvex and invex optimization problems with an interval-valued objective function under the conditions of weakly continuous differentiablity and Hukuhara differentiablity. Finally, the relationships between a class of variational-like inequalities and the interval-valued optimization problems are established.  相似文献   

17.
1 IntroductionRecently,various kinds of generalized convex functions were introduced.Bector andSingh[1 ] introduced a class of functions which called B-vex function.Bector,Suneja,andLalitha[2 ] introduced quasi B-vex function,pseudo B-vex function,B-invex function,quasi B-invex function,and pseudo B-invex function.We[3] extended invex function[4] ,gave thedefinitions of the symmetricη-function,symmetricη-pseudoconvex function,symmetricη-quasiconvex function for symmetric differentiable…  相似文献   

18.
集值映射多目标规划的K-T最优性条件   总被引:18,自引:1,他引:17  
讨论集值映射多目标规划(VP)的最优性条件问题.首先,在没有锥凹的假设下,利用集值映射的相依导数,得到了(VP)的锥--超有效解要满足的必要条件和充分条件.其次,在锥凹假设和比推广了的Slater规格更弱的条件下,给出了(VP)关于锥--超有效解的K--T型最优性必要条件和充分条件.  相似文献   

19.
该文研究了Riemann流形上的优化问题.首先,利用广义方向导数在Riemann流形上引入ρ-(η,d)-B不变凸函数、ρ-(η,d)-B伪不变凸函数和ρ-(η,d)-B拟不变凸函数.其次,讨论了变分不等式的解与Riemann流形上向量优化问题解之间的关系.最后,建立了优化问题的Kuhn-Tucker充分条件.  相似文献   

设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号