Choquet simplexes in finite dimension — A survey

This survey covers various geometric results related to Choquet simplexes in the Euclidean space E^d; it describes the known properties of Choquet simplexes and marks still open problems.     

Some Geometric Inequalities for a Tangent Point Simplex

The tangent point simplex of a simplex is the pedal simplex of the incenter of . In this paper we obtain some geometric inequalities between and .     

关于单形的几个不等式及其应用

Using theory of distance geometry and analytic method, the problem on relations about the volumes of some simplices is studied, and some new inequalities for the volumes of simplices are established. As special cases, an inequality for the volume of the pedal simplex of a simplex and other inequalities for simplices are gotten.     

如何利用单纯形表上的信息

本文分析了求解线性规划的基本方法－－单纯形法所使用的单纯形表，将表中所提供的信息分为直接信息和间接信息两类，论述了如何充分利用这些信息的方法。例如如何由最终表求原问题、如何利用表中的数据互相推演和校正等。这是一篇教学经验的总结，对初学者可能有一定的帮助。     

单纯形法检验数的新计算方法

单纯形法仍然是求解线性规划最具竞争力的算法之一,改进它的计算效率仍具有理论和现实意义.本文通过改进检验数的计算方式,提出了一种实施单纯形法新的计算方式.这种计算方式方便简单,无论采用单纯形表还是采用数值迭代计算都可以提高计算效率.     

基于线性规划核心矩阵的单纯形算法

本文讨论了线性规划中的核心矩阵及其特性,探讨了利用核心矩阵实现单纯形算法的可能性,并进一步提出了一个基于核心矩阵的两阶段原始一对偶单纯形方法,该方法通过原始和对偶两个阶段的迭代,可以在有限次迭代中收敛到原问题的最优解或证明问题无解或无界．在试验的22个问题中,该算法的计算效率总体优于基于传统单纯形方法的MINOS软件．     

一种简易的单纯形表

通过对单纯形法的分析和研究,提出了一种简易的单纯形表,并利用矩形法则进行计算而得到一种改进的单纯形法.结果表明该法简单易行,并减少了计算量和存储量.     

修正单纯形法的计算量的注记

对文献［１］、［２］指出的修正单纯形法的计算量提出了异议,并给出了修正单纯形法应有的计算量。     

关于高维单形体积的不等式

给出了高维单形与界面有关的体积不等式和与二面角有关的体积不等式,进而建立正则单形的有别于定义式的体积公式.     

对“求线性规划问题可行基的一种方法”的修正

指出[1]方法中某些重要结论的欠妥之处，并给出修正结果，使方法得以正确和完善。     

A new strongly polynomial dual network simplex algorithm

This paper presents a new dual network simplex algorithm for the minimum cost network flow problem. The algorithm works directly on the original capacitated network and runs in O(mn(m +n logn) logn) time for the network withn nodes andm arcs. This complexity is better than the complexity of Orlin, Plotkin and Tardos’ (1993) dual network simplex algorithm by a factor ofm/n.     

求解0-1线性整数规划问题的有界单纯形法

提出了一种求解0-1线性整数规划问题的有界单纯形法, 不仅通过数学论证, 讨论了该方法的合理性, 奠定了其数学理论基础, 而且通过求解无容量设施选址问题, 验证了该方法的可行性. 在此基础上, 就该有界单纯形法的不足和存在的问题, 给出了进一步改进的途径和手段.     

An Improvement of the Veljan-Korchmàros Inequality

LetS.=(A.,A1,..',A,)beann-dimensionalsimplexwithvolumeVinEn,do=IA,A,Ithedistancebetweenitsvertics.ThenandequalityoccursiffS"isaregu1arsimplex-Thisisthewe1l-knownVeljan-Korcl1mdrosinequality.First,itwasoneconjecturebyD.Veljan,andthenwasprovedbyKorchmdros([lj).L.YangandJ.Zh.Zhanggeneralizedinequality(l).Theyprovedamajorizationofthevolumeeofasimplexintermsofitsfacets([2]).Y'Zhanggaveansharpeningoftheinequality(l).([3J).Inthispaper,weproveanewsharpeningoftheVeljan-Korchmdrosinequality,a…     

关于“两个不等式的推广”的否定

本文指出文 [1 ]中所得的结论是错误的 ,并给出了修正后的结论及其推广和应用 .     

Inequalities for Volumes of Simplices in Terms of Their Faces

By generalizing some well-known results, we first obtain an inequality involving the volume and product of s-contents of s-faces of an n-simplex. Using this we generalize two inequalities maximizing the volume of one or two simplices in terms of their edge lengths.     

关于改进单纯形法的一条注记

指出并修正了文献［１］中改进单纯形法的一处错误。     

关于内接单形的一个几何不等式

本文建立了n维单形Ωn与其内接单形Ω′n的外接球半径和内切球半径的一个几何不等式，它包含了n维Euler不等式。     

Polynomial dual network simplex algorithms

We show how to use polynomial and strongly polynomial capacity scaling algorithms for the transshipment problem to design a polynomial dual network simplex pivot rule. Our best pivoting strategy leads to an O(m ² logn) bound on the number of pivots, wheren andm denotes the number of nodes and arcs in the input network. If the demands are integral and at mostB, we also give an O(m(m+n logn) min(lognB, m logn))-time implementation of a strategy that requires somewhat more pivots.Research supported by AFOSR-88-0088 through the Air Force Office of Scientific Research, by NSF grant DOM-8921835 and by grants from Prime Computer Corporation and UPS.Research supported by NSF Research Initiation Award CCR-900-8226, by U.S. Army Research Office Grant DAAL-03-91-G-0102, and by ONR Contract N00014-88-K-0166.Research supported in part by a Packard Fellowship, an NSF PYI award, a Sloan Fellowship, and by the National Science Foundation, the Air Force Office of Scientific Research, and the Office of Naval Research, through NSF grant DMS-8920550.     

联系两个n维单形的一类不等式

本文给出了联系两个ｎ维单形的一类不等式，从而推广和改进了文［１］、［２］［３］的结论。     

线性规划联合算法的理论与应用

本在[1]的基础上．较系统的叙述了线性规划联合算法的步骤、相关理论及其应用，指出该算法具有避免人工变量、减少迭代次数、使用灵活、应用方便等特点。