Constructing a strict total order for alternatives characterized by multiple criteria: An extension

The problem of finding a strict total order for a finite set of multiple criteria alternatives is considered. Our research extends previous work by us, which considered finding a partial order for a finite set of alternatives. We merge the preference information extracted from the preference cones and corresponding polyhedral sets, with the information derived from pairwise comparisons of two alternatives, yielding a preference matrix. This preference matrix is used as input to an integer programming model to obtain a strict total order that provides a transitive ranking for the set of alternatives. © 2014 Wiley Periodicals, Inc. Naval Research Logistics 61: 155–163, 2014     

军用数字地图中政区的构建及绘制方法

依据境界之间的拓扑数据,采用拓扑分析、边界追踪、边界闭环构建、边界约束下的凸分解、区域填充和边界符号化等技术手段,提出了OpenGL渲染环境下军用数字地图政区的构建方法.通过具体的软件开发和真实数据的测试,证明该方法生成政区准确、符号美观,可适用于不同比例尺下数字地图的显示.该算法具有较强的通用性,遵循国军标的相关规定,已经在相关数字地图软件中得以应用.     

CONTRIBUTORS

ABSTRACT

Narratives about Brazil's nuclear program are distorted by supporters and critics alike. In Brazil, the national nuclear infrastructure is undergoing a period of expansion, with plans to build new nuclear power plants and industrial-scale fuel production facilities. While Brazil's leaders herald the nuclear sector as a triumph for indigenous science and technology, foreigners view the nuclear program as a dangerous legacy of the military regime. This discrepancy becomes even more apparent in discussions about the ongoing construction of Brazil's first nuclear powered submarine. Brazil's military touts the submarine as a symbol of political status, economic growth, and military might. But from abroad, the military's involvement in nuclear development is considered unnecessary, worrisome, and even irresponsible. These narratives—often incomplete or selective—have polarized discussions about Brazil's nuclear submarine program and caused considerable political antagonism during safeguards negotiations. This article works to dispel myths, highlight legitimate concerns, and explain historical perspectives that shed light on some difficulties that can be anticipated in future negotiations.     

Banach空间中拟非扩展映象的不动点的迭代逼近

研究了严格凸Banach空间中非空间凸子集上拟非扩展映象的不动点的迭代逼近问题,主要证明了:设E是严格凸Banach空间,K为E的闭凸子集,T:K→K为连续拟非扩展映象。进一步假设T(K)包含于K的一个紧子集之中,迭代地定义序列{xn}∞n=1如下:(IS)yn=(1-βn)xn+βnTxn,n≥1,xn+1=(1-αn)xn+αnTyn,n≥1,其中{αn}和{βn}满足一定的条件,则{xn}强收敛于T的某个不动点。     

在Vs．net集成环境下创建带卸载的安装程序

创建安装程序是一件很简单的事,Vs.net提供了创建安装程序的向导,开发人员能够轻松地创建一个便于用户使用的安装程序。而按向导创建的安装程序没有为用户提供相应的卸载程序或快捷方式,为用户带来许多不便。以示例的形式详细介绍如何在Vs.net集成环境下创建带卸载的安装程序。     

基于POPS和PSR的美军里程碑节点审查方法

里程碑节点审查是美军装备采办过程中的核心控制手段。选取美军在该领域应用的最具代表性的项目成功可能性评审方法(Probability of Program Success,POPS)和项目支持评审方法(Program Support Review,PSR),围绕任务目标归纳出方法的主要思路,从程序步骤、评审内容框架等方面深入探究方法的特点,并从应用条件、使用范围、优点和局限性等方面进行对比分析,最后提出启示建议,为优化我军节点审查方法、提升装备采购过程管控能力提供借鉴和参考。     

Maximizing the ratio of two convex functions over a convex set

The purpose of this article is to present an algorithm for globally maximizing the ratio of two convex functions f and g over a convex set X. To our knowledge, this is the first algorithm to be proposed for globally solving this problem. The algorithm uses a branch and bound search to guarantee that a global optimal solution is found. While it does not require the functions f and g to be differentiable, it does require that subgradients of g can be calculated efficiently. The main computational effort of the algorithm involves solving a sequence of subproblems that can be solved by convex programming methods. When X is polyhedral, these subproblems can be solved by linear programming procedures. Because of these properties, the algorithm offers a potentially attractive means for globally maximizing ratios of convex functions over convex sets. © 2006 Wiley Periodicals, Inc. Naval Research Logistics, 2006     

D运输问题在物资调度中的应用

D运输问题是含离散目标约束的目标规划问题.首先将此多目标问题转化为单一目标问题,使之简化为传统的运输问题,然后使用一种相对简单的方法求解.最后结合一个实例,讨论了D运输问题在物资调度中的应用.     

战场物资快速运输的指挥控制

针对战场快速物资运输的指挥控制问题,提出一种基于线性规划的方法。根据供求双方物质的供应和需求总量、地理空间上的位置以及运输工具的运载能力等信息,制订一个满足供求双方物资总运载量,并以运送所有物资耗费时间为最小的优化目标,改进了传统运输问题模型。仿真分析表明,该方法为实现战场物资快速运输的指挥控制提供了有价值的参考。