求解最大利润流问题的一个算法

为了便于建立与最大利润流问题有关的决策支持系统，本给出了一个交易网络中求最大利润流的数值算法，证明了算法的理论依据，并举例了说明算法的应用。该算法能求得问题的最优解，并具有易于编程实现、收敛性好等优点，大量数值实验表明该算法非常实用有效。     

关于几类图的L(3,2,1)-标号问题

图G的L(2，1)-标号是一个从顶点集V(G)到非负整数集的函数f(x)，使得若d(z，y)=1则|f(x)-f(y)|≥2；若d(x，y)=2，则|f(x)-f(y)|≥1。图G的L(2，1)-标号数是λ(G)使得G有的max|f(v)：v∈V(G)|=κ的L(2，1)-标号中的最小数κ。本将L(2，1)-标号问题推广到更一般的情形即L(3，2，1)标号问题，并得到了平面三角剖分图、立体四面体剖分图的λ3(G)的上界。     

一类组合投资问题的线性规划解法

根据选定总体风险的一个上界值使组合投资的收益率达到最大的原则，并在合理简化的基础上建立组合投资决策问题的线性规划模型。然后通过算例求解带有参数的线性规划问题，给出资产组合的风险控制值和相应的最大净收益率及投资比例向量的关系。     

求解指派问题的一个算法

为了便于建立与指派问题有关的决策支持系统，本给出了一个求解指派问题的数值算法，证明了算法的理论依据。该算法能求得问题的最优解，并具有易于编程实现、收敛性好等优点，大量数值实验表明该算法非常实用有效。     

A SEQUENTIAL APPROACH TO DERIVATION OF STAND TREATMENT AND FOREST-WIDE HARVEST PRESCRIPTION OR SUPPLY

Current methods for optimization of stand treatment and forest-wide harvest scheduling use mathematical programming that presumes perfect information on production, costs, and revenues over long planning periods. These approaches simultaneously optimize harvest for all periods in the planning horizon. In contrast, the method presented here assumes that stand-level planning and harvest scheduling proceed sequentially rather than simultaneously over every period. A backward-recursion dynamic program is used to determine the discounted net value of a wide range of current harvest strategies for each stand class in the forest inventory on the basis of a projected set of optimal treatments for future harvest and regeneration of each stand. The most highly valued strategy is selected if there are no volume constraints. Otherwise, suboptimal harvest alternatives are ranked in order of increasing opportunity cost for increasing or decreasing harvest; constraints met only up to a maximum opportunity cost is also demonstrated.     

Dynamic Aggregation Operators Based on Intuitionistic Fuzzy Tools and Einstein Operations

The idea of combine aggregation and intuitionistic fuzzy information plays essential role in multi criteria decision making (MCDM) process. However, this new branch has attracted researchers that study in different fields recently. In this paper, we study MCDM problems with intuitionistic fuzzy environment. Firstly, we introduce some operations related with Einstein t-norm and t-conorm such as, Einstein sum, product and exponentiation. After that, we define dynamic intuitionistic fuzzy Einstein averaging (DIFWA${}^{?}$) operator and dynamic intuitionistic fuzzy Einstein geometric averaging (DIFWG${}^{?}$) operator. Their notable property is that collect and aggregate values in different period based on Einstein operations in intuitionistic fuzzy set (IFS)s. In addition, we compare the defined operators with the existing intuitionistic fuzzy dynamic operators and get the corresponding relations. We establish two methods using with DIFWA${}^{?}$ and DIFWG${}^{?}$ to solve MCDM problems with intuitionistic fuzzy tools. Finally, an illustrated example is presented to show the applicability of the introduced methods.     

Graphs of NMS Flows on S^3 with Knotted Saddle Orbits and No Heteroclinic Trajectories

We consider NMS systems on S^3 without heteroclinic trajectories connecting two saddles orbits and we build the dual graphs associated with this kind of flows. We prove that flows coming from essential attachments of orientable round 1-handles can be reproduced from the corresponding dual graph.     

与"求线性规划问题可行基的一种方法"的再商榷

再次说明文[1]提出的方法不能直接使用，仍须按文[2]的修正结果实行才是正确的。同时指出最近提出的某些算法的不实之处，以飨读者，避免误导。     

区间数的标准表示及其四则运算法则与泛灰数的内在联系

在回顾泛灰数四则运算法则基础上,给出了区间数的标准表示,论述了标准区间数的四则运算法则与泛灰数的内在联系及其应用前景.     

路政应急管理中资源布局的混合整数规划模型

本文根据道路灾害事故的发生特点,对城市路桥养护系统的运行模式和资源的合理调用机理进行分析,考虑到事发地点潜在的资源需求概率,建立资源布局的混合整数规划模型.本模型中资源布局方案的调度决策基础是在灾害事故的资源需求不发生变化的条件下,使得每个救助点的资源同时部分地为辖区内现有事故和潜在事故服务,而现有事故的剩余需求由其他救助点派出资源来满足.该模型的目标是解决城市中因同一时间段内发生两起灾害事故而造成路桥破坏导致的救助资源短缺问题,同时避免资源的闲置浪费.最后,通过算例证明,本方法较通常方法对城市总的资源配置量大大减少.