强向量均衡问题与不动点问题的粘性逼近算法

讨论了强向量均衡问题与非扩张映射不动点问题的公共解.首先,给出了强向量均衡问题的辅助问题,并在适当的条件下,证明了其解的存在性和唯一性结果.然后,利用这些结果,提出了强向量均衡问题与非扩张映射不动点问题公共解的粘性逼近算法,并进一步证明了,在适当的条件下,由该算法产生的迭代序列强收敛于强向量均衡问题和非扩张映射不动点问题的公共解.     

广义平衡与不动点问题的黏性逼近

本文的目的是在Hilbert空间中引入和研究了一种新的迭代序列,用以寻求具逆一强单调映象的广义平衡问题的解集与无限簇非扩张映象的不动点集的公共元.在适当的条件下,用黏性逼近法证明了逼近于这一公共元的强收敛定理.应用该结论,我们证明了逼近于平衡问题和变分不等式问题的强收敛定理.所得结果改进和推广了文献的相应结果.     

对称的运输问题及其逆问题

本文对［１,２,６］中提出的运输问题进行了推广,并提出了一个强多项式算法,从而改进了原有的结果．同时对对称的运输问题的逆问题进行了研究,并借助于最小费用循环流技术得到了一个强多项式算法．     

非凸集值优化问题严有效解的强对偶定理

本文研究了非凸集值向量优化的严有效解在两种对偶模型的强对偶问题.利用Lagrange对偶和Mond-Weir对偶原理,获得了如下结果：原集值优化问题的严有效解,在一些条件下是对偶问题的强有效解,并且原问题和对偶问题的目标函数值相等;推广了集值优化对偶理论在锥-凸假设下的相应结果.     

Hilbert空间中广义平衡问题和不动点问题的粘滞逼近法

在Hilbert空间,我们用粘滞逼近法建立了一迭代序列来逼近两个集合的公共点,这两个集合分别是广义平衡问题的解集和渐进非扩张映射的不动点集.我们表明这一迭代序列强收敛到这两个集合的公共点,而且这一公共点还是一变分不等式的解.用这一结果,还研究了三个强收敛问题和优化问题.     

存零约束优化问题的对偶问题

本文研究了近年提出的一类新优化问题存零约束优化问题,因存零约束的存在,使得求解最优解较困难.因此,本文针对存零约束优化问题,利用对偶理论提出了问题的Wolfe型对偶模型.在凸性和严格凸性假设下,获得了Wolfe对偶的弱、强、逆、限制逆和严格逆对偶结果.并进行了实例论证.     

Hilbert空间上新的变分不等式问题和不动点问题的粘性迭代算法

本文在Hilbert空间上引入了一个新的粘性迭代算法,找到了关于两个逆强单调算子的变分不等式问题的解集与非扩张映射的不动点集的公共元.通过修改的超梯度算法,得到了强收敛定理,也给出了一个数值例子.所得结果改进了许多最新结果.     

广义强向量拟均衡问题组解的存在性

本文研究了一类集值广义强向量拟均衡问题组解的存在性问题.利用集值映射的自然拟C-凸性和集值映射的下(-C)-连续性的定义和Kakutani-Fan-Glicksberg不动点定理,在不要求锥C的对偶锥C~*具有弱*紧基的情况下,建立了该类集值广义强向量拟均衡问题组解的存在性定理.所得结果推广了该领域的相关结果.     

非凸集值优化问题严有效解的强对偶定理（英文）

本文研究了非凸集值向量优化的严有效解在两种对偶模型的强对偶问题.利用Lagrange对偶和Mond-Weir对偶原理,获得了如下结果:原集值优化问题的严有效解,在一些条件下是对偶问题的强有效解,并且原问题和对偶问题的目标函数值相等;推广了集值优化对偶理论在锥-凸假设下的相应结果.     

一类非线性变分包含问题解的存在性和迭代逼近问题

研究了实自反Banach空间中一类具有L ipsch itz条件的强增生型变分包含解的存在性、唯一性及其具有混合误差项的M ann迭代程序的收敛性问题.另一方面,一个相关结果,讨论了一类强增生型变分不等式解的存在性和带有混合误差项的M ann迭代序列的收敛性.结果改进和推广了张石生,曾六川等人的相应结果.     

广义平衡问题与非扩张映象不动点问题公解的一个新迭代方法

In this paper,we introduce a new iterative scheme for finding a common element of the set of solutions for a generalized equilibrium problems and the set of fixed points for nonexpansive mappings in Hilbert space.Under suitable conditions,some strong convergence theorems are proved.Our results extend and improve some recent results.     

双会议服务器选址问题研究

中位选址问题一直是管理学科的研究热点,本文考虑平面点集选址问题中的双会议服务器选址问题,该问题可以看成是2中位问题的衍生问题。令P为平面上包含n个点的点集,双会议服务器选址问题即为寻找由该点集构成的一棵二星树,使得这棵树上所有叶子之间的距离和最小。本文给出求解该问题的关键几何结构和最优解算法设计,并证明所给算法时间复杂性为O(n³logn)。     

席位分配问题的一种新算法

讨论了席位分配问题的已有方法与H.P.Y oung公理体系中公理4之间的关系.通过数据算例指出已有方法都不能使公理4与极差最小同时满足.据此,我们建立了在满足公理4的前提下的最小极差法.     

解非负约束图像去模糊问题的积极集方法

研究非负约束全变分图像去模糊问题,提出了一个基于增广拉格朗日方法的积极集方法,并证明了该方法在有限步内可求解,进一步推出该方法等价于解非光滑方程组的半光滑牛顿法.     

AT-free图的配对控制集算法

本文给出了配对控制集在AT-free图的BFS-树上分布的结构性质．利用这些性质，我们给出了求解AT-free图类最小配对控制集的多项式时间算法．     

The Multidimensional Moment Problem with Complexity Constraint

A long series of previous papers have been devoted to the (one-dimensional) moment problem with nonnegative rational measure. The rationality assumption is a complexity constraint motivated by applications where a parameterization of the solution set in terms of a bounded finite number of parameters is required. In this paper we provide a complete solution of the multidimensional moment problem with a complexity constraint also allowing for solutions that require a singular measure added to the rational, absolutely continuous one. Such solutions occur on the boundary of a certain convex cone of solutions. In this paper we provide complete parameterizations of all such solutions. We also provide errata for a previous paper in this journal coauthored by one of the authors of the present paper.     

价格控制问题的基本性质

价格控制问题是一类重要的二层规划问题。最近,文[3,4]讨论了价格控制问题的最优性条件和解集的性质。本文先用反例说明[3]中关于价格控制问题的可行解的充分必要条件的一个命题是不确切的,并对[4]中基于该命题证得的不可靠结论在适当条件下进行了证明。     

The Clustered Orienteering Problem

In this paper we study a generalization of the Orienteering Problem (OP) which we call the Clustered Orienteering Problem (COP). The OP, also known as the Selective Traveling Salesman Problem, is a problem where a set of potential customers is given and a profit is associated with the service of each customer. A single vehicle is available to serve the customers. The objective is to find the vehicle route that maximizes the total collected profit in such a way that the duration of the route does not exceed a given threshold. In the COP, customers are grouped in clusters. A profit is associated with each cluster and is gained only if all customers belonging to the cluster are served. We propose two solution approaches for the COP: an exact and a heuristic one. The exact approach is a branch-and-cut while the heuristic approach is a tabu search. Computational results on a set of randomly generated instances are provided to show the efficiency and effectiveness of both approaches.     

Weak and Strong Convergence Theorems for a Nonexpansive Mapping and an Equilibrium Problem

In this paper, we introduce two iterative sequences for finding a common element of the set of fixed points of a nonexpansive mapping and the set of solutions of an equilibrium problem in a Hilbert space. Then, we show that one of the sequences converges strongly and the other converges weakly.     

Conjugate Intervals for the Linear Fixed-Endpoint Control Problem

For certain optimal control problems with piecewise continuous controls, recently Loewen and Zheng (Ref. 1) and Zeidan (Ref. 2) defined two sets of generalized conjugate points for which, under normality assumptions, the second-order conditions in terms of the accessory problem imply their emptiness. However, simple examples show that checking the existence of such points may be more difficult than directly finding variations that make the second variation negative. In this paper, for the linear fixed-endpoint control problem, we introduce a new set whose emptiness is equivalent to the nonnegativity of the second variation along admissible variations. Moreover, we achieve by means of this set the main objective of introducing a characterization of this condition, namely, to obtain a simpler way of verifying it.