不可微多目标优化

本文首先说明了什么是不呆微多目标优化问题，然后概括性地介绍了多目标优化研究的主要内容，在此基础上，对不可微多目标优化的主要结果和内容加以综述。     

一类G-(F,ρ)凸多目标分式规划的最优性条件

本文讨论了一类多目标分式规划问题，其中所包含的函数是局部Lipschitz的和Clarke次可微的．首先，在G-(F，ρ)凸的条件下，证明了择一定理．然后，证明了该多目标分式规划问题在Geoffrion意义下的真有效解的充分条件和必要条件．     

拟凸函数的近似次微分及其在多目标优化问题中的应用

针对拟凸函数提出一类新的近似次微分,研究其性质,并将近似次微分应用到拟凸多目标优化问题近似解的刻画中.首先,对已有的近似次微分进行改进,得到拟凸函数新的近似次微分,并给出其与已有次微分之间的关系及一系列性质.随后,利用新的近似次微分给出拟凸多目标优化问题近似有效解、近似真有效解的最优性条件.     

参数化方法在解多目标优化中的应用

求解多目标优化的 参数化方法本质上是将多目标评价函数中的权系数视为可变参数。本文从一般的含参数的优化问题出发，论述了最优解连续依赖于参数的变化。本文的数值例子将表是，采用这种处理方法，可达到人们的预期目的。     

多目标半定规划的互补弱鞍点和G-鞍点最优性条件

对于含矩阵函数半定约束和多个目标函数的多目标半定规划问题，给出Lagrange函数在弱有效意义下的互补弱鞍点和Geofrrion恰当有效意义下的G-鞍点的定义及其等价定义．然后，在较弱的凸性条件下，利用含矩阵和向量约束的择一性定理，建立多目标半定规划的互补弱鞍点和G-鞍点充分必要条件．     

一类多目标Lipschitz规划的对偶定理

Lipschitz函数定义了广义本性伪凸的概念,建立了多目标Lipschitz规划的Mond-Weir型对偶和Wolfe型对偶,证明了原规划与对偶规划之间的对偶定理。     

n—集合函数多目标规划的最优性条件

本文在广义ρ－凸的条件下给出了ｎ集合函数多目标规划解的必要和充分条件。     

非光滑非凸多目标优化不动点方法

本文首次讨论了用不动点刻划的不可微多目标优化的最优性必要条件和充分条件，并研究了不动点算法求解此问题的方法及大范围收敛性．为不可微多目标优化研究提供了另一条新的途径．     

非凸多目标优化模型的一类鲁棒逼近最优性条件

通过引入一类非凸多目标不确定优化问题，借助鲁棒优化方法，先建立了该不确定多目标优化问题的鲁棒对应模型；再借助标量化方法和广义次微分性质，刻画了该不确定多目标优化问题的鲁棒拟逼近有效解的最优性条件，推广和改进了相关文献的结论.     

多目标优化问题Proximal真有效解的最优性条件

在广义凸性假设下,给出了集合proximal真有效点的线性标量化,并在此基础上证明了它与Benson真有效点和Borwein真有效点的等价性.将这些结果应用到多目标优化问题上,得到proximal真有效解的最优性条件.最后,利用proximal次微分,得到了proximal真有效解的模糊型最优性条件.     

On the Parametric Decomposition Theorem in Multiobjective Optimization

An example is given to show the inadequacy of a well-known result, concerning the parametric decomposition theorem for multiobjective optimization problems. We also give an accurate decomposition theorem, which generalizes a corrected reformulation of this result.     

A Theorem on Strict Separability of Convex Polyhedra and Its Applications in Optimization

We propose a new approach to the strict separation of convex polyhedra. This approach is based on the construction of the set of normal vectors for the hyperplanes, such that each one strict separates the polyhedra A and B. We prove the necessary and sufficient conditions of strict separability for convex polyhedra in the Euclidean space and present its applications in optimization.     

Multiobjective Optimization of the Flow Around a Cylinder Using Model Order Reduction

In this article an efficient numerical method to solve multiobjective optimization problems for fluid flow governed by the Navier Stokes equations is presented. In order to decrease the computational effort, a reduced order model is introduced using Proper Orthogonal Decomposition and a corresponding Galerkin Projection. A global, derivative free multiobjective optimization algorithm is applied to compute the Pareto set (i.e. the set of optimal compromises) for the concurrent objectives minimization of flow field fluctuations and control cost. The method is illustrated for a 2D flow around a cylinder at Re = 100. (© 2015 Wiley-VCH Verlag GmbH & Co. KGaA, Weinheim)     

多目标优化问题的模糊交叉算法与收敛性

本文研究了目标权重未事先确知的多目标优化问题，建立可以同时确定目标权重与方案相对优属度的模糊交叉迭代算法，严格证明了该算法的局部收敛性．     

FK-映射的匹配定理及其对约束多目标对策的应用

利用 KKM 技巧,建立了FC-空间中转移紧开值FK-映射的Ky Fan匹配定理.作为应用,获得了FC-空间中的Ky Fan重合定理、约束多目标对策的加权 Nash-平衡和Pareto-平衡的存在定理.     

关于极限定理的一个结果及其推广

给出了一个关于可列非齐次马尔可夫链M元状态序组出现频率的一个强极限定理及其推广,所得结论对任意可列非齐次马尔可夫链普遍成立.     

A Theorem of the Alternative and Its Application to the Optimization of Set-Valued Maps

In this paper, we establish a theorem of the alternative in ordered linear topological spaces. Then, optimality conditions for the optimization of set-valued maps are obtained.     

Constraint Qualifications in Nonsmooth Multiobjective Optimization

For an inequality constrained nonsmooth multiobjective optimization problem involving locally Lipschitz functions, stronger KT-type necessary conditions and KT necessary conditions (which in the continuously differentiable case reduce respectively to the stronger KT conditions studied recently by Maeda and the usual KT conditions) are derived for efficiency and weak efficiency under several constraint qualifications. Stimulated by the stronger KT-type conditions, the notion of core of the convex hull of the union of finitely many convex sets is introduced. As main tool in the derivation of the necessary conditions, a theorem of the alternatives and a core separation theorem are also developed which are respectively extensions of the Motzkin transposition theorem and the Tucker theorem.     

集合函数多目标规划的拉格朗日型对偶定理

本文在［１］的基础上．给出了集合函数多目标规划的拉格朗日型弱对偶定理，严格对偶定理和逆对偶定理．