A finite cutting plane method for facial disjunctive programs

This paper shows that any linear disjunctive program with a finite number of constraints can be transformed into an equivalent facial program. Based upon linear programming technique, a new, finite cutting plane method is presented for the facial programs.

---

Zusammenfassung Die Arbeit zeigt, daß jedes lineare disjunktive Optimierungsproblem mit endlich vielen Restriktionen in ein äquivalentes Fazetten-Problem transformiert werden kann. Auf der Grundlage von linearer Optimierungstechnik wird für das Fazetten-Problem ein neues, endliches Schnittebenenverfahren vorgestellt.

     

基于单纯形方法的双层线性规划全局优化算法

通过分析双层线性规划可行域的结构特征和全局最优解在约束域的极点上达到这一特性,对单纯形方法中进基变量的选取法则进行适当修改后,给出了一个求解双层线性规划局部最优解方法,然后引进上层目标函数对应的一种割平面约束来修正当前局部最优解,直到求得双层线性规划的全局最优解.提出的算法具有全局收敛性,并通过算例说明了算法的求解过程.     

Al12N、Al12B团簇结构和电子性质的密度泛函计算

利用密度泛函理论研究了Al12N和Al12B团簇的原子结构和电子性质,通过各种异构体的比较,发现两种掺杂团簇的最低能量结构都是完好的二十面体(Ih)结构,N(B)原子占据在二十面体的中心.高对称性团簇形成稀疏离散的电子态密度和大的电子能隙.在Al-N之间发生较大的电荷转移.因此我们建议把Al12N团簇看作是碱金属超原子,Al12B团簇看作是卤素超原子,用来构造团簇组装固体.     

Cooperative games of choosing partners and forming coalitions in the marketplace

Two games of interacting between a coalition of players in a marketplace and the residual players acting there are discussed, along with two approaches to fair imputation of gains of coalitions in cooperative games that are based on the concepts of the Shapley vector and core of a cooperative game. In the first game, which is an antagonistic one, the residual players try to minimize the coalition's gain, whereas in the second game, which is a noncooperative one, they try to maximize their own gain as a coalition. A meaningful interpretation of possible relations between gains and Nash equilibrium strategies in both games considered as those played between a coalition of firms and its surrounding in a particular marketplace in the framework of two classes of n-person games is presented. A particular class of games of choosing partners and forming coalitions in which models of firms operating in the marketplace are those with linear constraints and utility functions being sums of linear and bilinear functions of two corresponding vector arguments is analyzed, and a set of maximin problems on polyhedral sets of connected strategies which the problem of choosing a coalition for a particular firm is reducible to are formulated based on the firm models of the considered kind.     

B值鞅型序列的一些极限定理

本文讨论了一些B值鞅型序列的强大数定律 ,弱大数定律 ,Lr收敛性及完全收敛性 ,推广了许多熟知的结果 .     

CSR外靶实验终端中子流测量的模拟

随着兰州重离子加速器冷却储存环(HIRFL-CSR)外靶实验终端中子墙的建立, 为实验测量高能中子提供了机遇. 为确定CSR外靶实验终端对中子流测量的可行性, 基于BUU理论模型分别对对称系统(Ni+Ni, Pb+Pb)和非对称系统(Pb+Ni)进行了模拟计算, 发现当系统能量达到几百MeV/u时, 中子流信号相当明显, 并与碰撞参数有明显的依赖关系. 模拟结果表明, 在前角20°的覆盖范围内, 可以较好地实现中子流测量所需要的反应平面确定及碰撞参数选择. 对双击事件及其对中子流的影响进行了简单的讨论.     

On superlinear convergence of quasi-Newton methods for nonsmooth equations

We show that strong differentiability at solutions is not necessary for superlinear convergence of quasi-Newton methods for solving nonsmooth equations. We improve the superlinear convergence result of Ip and Kyparisis for general quasi-Newton methods as well as the Broyden method. For a special example, the Newton method is divergent but the Broyden method is superlinearly convergent.     

触销式双障碍买权价值过程鞅性

主要证明了在不存在交易成本的完全市场条件下连续时间欧式触销式双障碍买权贴现到0时刻的价值过程为鞅,并且给出了对应单障碍买权价值过程的鞅性质.同时还讨论了执行价格为随机的触销式双障碍买权的鞅性质,给出了任意时刻 t(0≤ t≤T)其内在价值的表达式.     

TERNARY OPERATIONS AS PRIMITIVE NOTIONS FOR PLANE GEOMETRY II

We proved in the first part [1] that plane geometry over Pythagorean fields is axiomatizable by quantifier-free axioms in a language with three individual constants, one binary and three ternary operation symbols. In this paper we prove that two of these operation symbols are superfluous.     

一类周期种群系统的适定性及最优控制

本文研究了一类非线性周期种群系统的适定性及最优控制问题 .利用压缩不动点原理讨论了该种群系统的周期解的存在唯一性 .并用变分法给出了最优控制所满足的必要条件 .