多面体集下多目标优化问题近似解的若干性质

研究了多目标优化问题的近似解. 首先证明了多面体集是 co-radiant集,并证明了一些性质. 随后研究了多面体集下多目标优化问题近似解的特殊性质.     

Asplund空间中非凸向量均衡问题近似解的最优性条件

在Asplund空间中,研究了非凸向量均衡问题近似解的最优性条件.借助Mordukhovich次可微概念,在没有任何凸性条件下获得了向量均衡问题εe-拟弱有效解,εe-拟Henig有效解,εe-拟全局有效解以及εe-拟有效解的必要最优性条件.作为它的应用,还给出了非凸向量优化问题近似解的最优性条件.     

集值映射向量优化问题的锥弱有效解的镇定性和稳定性

本文研究了集值映射向量优化问题的锥弱有效解的镇定性和稳定性,我们引进了集值映射向量优化问题的镇定性和稳定性的定义,并证明了集值映射问题优化问题的镇定性和稳定性的一些主要定理。     

不确定凸优化问题鲁棒近似解的最优性

该文研究一类目标和约束函数均带有不确定信息的凸优化问题的鲁棒近似解.首先,在闭凸锥约束品性假设下,得到了该不确定优化问题关于近似解的最优性条件.然后,引入所研究不确定优化问题的近似鞍点的概念,并给出了近似解的鞍点刻划.     

集值映射向量优化问题的e-真有效解

引入了集值映射向量优化问题的αe-弱有效解、e-真有效解、e-真鞍点概念,在近似广义C-次似凸条件下,建立了e-真有效解的标量化定理、Lagrang乘子定理和e-真鞍点定理,并讨论了集值映射向量优化问题的αe-弱有效解的标量化定理和Laugrange乘子定理,推广了已有结果。     

co-radiant集的等价表示及其在向量优化问题中的应用

作为特殊的抽象凸(凹)集,radiant集和co-radiant集在抽象凸分析和多目标优化问题理论中发挥着重要作用.首先建立radiant集co-radiant集的等价刻画,从而推导出它们的重要性质.然后,将重要性质应用到向量优化问题近似解的刻画中,得到关于近似解集的等价刻画.     

集值映射向量优化问题ε-超有效解集的连通性

本文在赋范向量空间中讨论集值映射向量优化问题的ε-超有效性，在锥-半连续和广义锥-次类凸的假设条件下，获得了ε-超有效点(解)集的连通性结果．     

常微分方程近似解的LS-SVM改进求法

提出一种基于最小二乘支持向量机(LS-SVMs)的求解常微分方程近似解的改进方法.该方法首先通过离散计算域,将常微分方程转换为有约束条件的目标优化问题,然后利用径向基(RBF)核函数可导的性质,用带有导数形式的LS-SVM模型将此优化问题转化为LS-SVM回归问题,进而进行求解.最终得到的闭式近似解具有精度高、连续可微、结构简单且形式固定的特点.该方法适用于任意阶非刚性和奇异的线性常微分方程初值问题和边值问题,以及一阶非线性常微分方程问题.仿真结果验证了该方法具有良好的有效性.     

向量优化问题的几个收敛性结果

在文本中，获得了集合的弱有效元与真有效元的几个收敛性结果。然后，讨论了集值映射向量优化问题（VP）和它的近似问题（VP）n，在较强的假设条件下，获得了（VP）n的真有效解的几个收敛性结果。     

一类集值映射向量优化问题的ε-有效解

集值映射向量优化问题是最优化理论中的一个重要方向.在集值映射为生成锥内部-锥一类凸(简记为ic-锥类凸)的假设条件下,利用择一定理,给出了集值映射向量优化问题ε-弱有效解和ε-有效解的最优性条件和ε-Lagrange乘子定理,是弱有效解和有效解相应结果的推广.     

On comparison of approximate solutions in vector optimization problems

The problem of comparison of approximations (approximate solutions to a vector optimization problem) obtained using different numerical methods is considered. In the absence of a priori information about the set of weakly efficient vectors, a scalar function is introduced that enables pair-wise comparison of approximations and establishes a binary preference relation according to which the approximations close (in the sense of the Hausdorff distance) to the set containing all possible efficient vectors are preferable to other approximations.     

On Minty variational principle for nonsmooth vector optimization problems with generalized approximate convexity

In this paper, we consider a nonsmooth vector optimization problem involving locally Lipschitz generalized approximate convex functions and find some relations between approximate convexity and generalized approximate convexity. We establish relationships between vector variational inequalities and nonsmooth vector optimization problem using the generalized approximate convexity as a tool.     

拟凸多目标优化问题近似解的最优性条件

研究了拟凸多目标优化问题近似弱有效解、近似有效解的最优性条件.首先,在已有拟凸函数次微分的基础上引进4种近似次微分的概念,并给出它们之间的关系.然后,将4种近似次微分的概念应用到拟凸多目标优化问题中,给出了拟凸多目标优化问题近似弱有效解和近似有效解的充分条件和必要条件,并给出实例加以说明.     

On approximate solutions in set-valued optimization problems

In this paper we introduce several concepts of approximate solutions of set-valued optimization problems with vector and set optimization. We prove existence results and necessary and sufficient conditions by using limit sets.     

Lower convergence of approximate solutions to vector quasi-variational problems

In this article, various types of approximate solutions for vector quasi-variational problems in Banach spaces are introduced. Motivated by [M.B. Lignola, J. Morgan, On convergence results for weak efficiency in vector optimization problems with equilibrium constraints, J. Optim. Theor. Appl. 133 (2007), pp. 117–121] and in line with the results obtained in optimization, game theory and scalar variational inequalities, our aim is to investigate lower convergence properties (in the sense of Painlevé–Kuratowski) for such approximate solution sets in the presence of perturbations on the data. Sufficient conditions are obtained for the lower convergence of ‘strict approximate’ solution sets but counterexamples show that, in general, the other types of solutions do not lower converge. Moreover, we prove that any exact solution to the limit problem can be obtained as the limit of a sequence of approximate solutions to the perturbed problems.     

Semicontinuity and convergence for vector optimization problems with approximate equilibrium constraints

This paper mainly intends to present some semicontinuity and convergence results for perturbed vector optimization problems with approximate equilibrium constraints. We establish the lower semicontinuity of the efficient solution mapping for the vector optimization problem with perturbations of both the objective function and the constraint set. The constraint set is the set of approximate weak efficient solutions of the vector equilibrium problem. Moreover, upper Painlevé–Kuratowski convergence results of the weak efficient solution mapping are showed. Finally, some applications to the optimization problems with approximate vector variational inequality constraints and the traffic network equilibrium problems are also given. Our main results are different from the ones in the literature.     

Approximate saddle-point theorems in vector optimization

The paper contains definitions of different types of nondominated approximate solutions to vector optimization problems and gives some of their elementary properties. Then, saddle-point theorems corresponding to these solutions are presented with an application relative to approximate primal-dual pairs of solutions.This research was carried out while the author was working at the Bureau for Systems Analysis, State Office for Technical Development, Budapest, Hungary. The author is indebted to the referees for their useful comments.