线-面传输线Taylor与Agrawal模型解的比较

基于Maxwell方程推导描述外电磁场对导线的耦合传输线模型有Taylor,Agrawal和Rachidi三种模型,每个耦合公式给出相同的传输线响应,但是它们之间又有细微的差别,Nucci和Rachidi通过数值方法验证在圆柱形雷电电磁场激励下这三种线-面传输线模型在负载终端具有相同的全电压解。本文采用解析的方法对线-面传输线Taylor模型和Agrawal模型进行研究,获得了这两个模型基于平面电磁波激励下的终端负载响应的解析解,证明了它们的解析解是相同的。也就是说,线-面传输线Taylor模型和Agrawal模型其实是对同一个解的不同描述。因此,在实际应用时,可以根据具体情况来选择不同的传输线模型进行求解。     

A novel modeling approach for express package carrier planning

Express package carrier networks have large numbers of heavily‐interconnected and tightly‐constrained resources, making the planning process difficult. A decision made in one area of the network can impact virtually any other area as well. Mathematical programming therefore seems like a logical approach to solving such problems, taking into account all of these interactions. The tight time windows and nonlinear cost functions of these systems, however, often make traditional approaches such as multicommodity flow formulations intractable. This is due to both the large number of constraints and the weakness of the linear programming (LP) relaxations arising in these formulations. To overcome these obstacles, we propose a model in which variables represent combinations of loads and their corresponding routings, rather than assigning individual loads to individual arcs in the network. In doing so, we incorporate much of the problem complexity implicitly within the variable definition, rather than explicitly within the constraints. This approach enables us to linearize the cost structure, strengthen the LP relaxation of the formulation, and drastically reduce the number of constraints. In addition, it greatly facilitates the inclusion of other stages of the (typically decomposed) planning process. We show how the use of templates, in place of traditional delayed column generation, allows us to identify promising candidate variables, ensuring high‐quality solutions in reasonable run times while also enabling the inclusion of additional operational considerations that would be difficult if not impossible to capture in a traditional approach. Computational results are presented using data from a major international package carrier. © 2008 Wiley Periodicals, Inc. Naval Research Logistics, 2008     

一类非线性二阶多点边值问题多个正解的存在性研究

通过定义适当的锥,运用锥映射的不动点定理,结合上下解方法,给出了二阶多点边值问题多个正解存在性的判定方法.作为特例,获得了三点边值问题多个正解存在性的判定依据,从而推广了相关文献中关于二阶三点边值问题正解存在性的结果.     

一类具有时滞和常数收获率的比率型功能性反应的捕食-被捕食模型的稳定性与Hopf分支

研究一类具有时滞和常数收获率的比率型功能性反应的捕食—被捕食模型。首先,分析了模型奇点的类型,研究了正平衡点的局部稳定性以及Hopf分支的存在性;然后应用中心流形和规范型理论,得到了关于确定Hopf分支方向和分支周期解稳定性的计算公式;最后,应用Matlab软件对所得理论结果进行了数值模拟。     

Approximation algorithms for sequential batch‐testing of series systems

We introduce and study a generalization of the classic sequential testing problem, asking to identify the correct state of a given series system that consists of independent stochastic components. In this setting, costly tests are required to examine the state of individual components, which are sequentially tested until the correct system state can be uniquely identified. The goal is to propose a policy that minimizes the expected testing cost, given a‐priori probabilistic information on the stochastic nature of each individual component. Unlike the classic setting, where variables are tested one after the other, we allow multiple tests to be conducted simultaneously, at the expense of incurring an additional set‐up cost. The main contribution of this article consists in showing that the batch testing problem can be approximated in polynomial time within factor , for any fixed . In addition, we explain how, in spite of its highly nonlinear objective function, the batch testing problem can be formulated as an approximate integer program of polynomial size, while blowing up its expected cost by a factor of at most . Finally, we conduct extensive computational experiments, to demonstrate the practical effectiveness of these algorithms as well as to evaluate their limitations. © 2016 Wiley Periodicals, Inc. Naval Research Logistics 63: 275–286, 2016     

关于算子方程Tx=y扰动分析的一些结果

在Banach空间中给出了一种相容算子方程解的误差估计 ,推广了矩阵扰动分析中的相应结果 .此外 ,利用Hilbert空间中算子M -P广义逆与算子的约化极小模之间的关系 ,给出了一些估计式 ,这些估计式对于分析不相容算子方程Tx =y的极小范数最小二乘解的扰动误差是有用的     

一类多目标模糊系数线性规划问题

讨论了一类所有系数均为模糊数的多目标线性规划问题 .通过对模糊数的比较 ,将模糊多目标线性规划模型转化为清晰的多目标模型 ,并应用一种基于线性隶属函数的模糊规划算法求其协调解 .最后给出了一个数值例子 .     

加权模糊C均值聚类算法实现BDS三频组合观测值优选

在对BDS三频载波相位组合观测值进行误差分析的基础上,确定了优选载波相位线性组合系数的筛选标准。针对传统聚类算法在高维多频混合数据集分类中存在的不足,采用一种基于加权的模糊C均值聚类算法,通过对同一维度在不同簇上赋予不同的权重值,对传统遍历搜索法所获得的部分BDS三频载波相位组合观测值进行了优化分类选取,有效解决了传统全球导航卫星系统载波相位观测值选取方法效率低的问题,同时为多系统多频数据组合观测值系数的优化选取提供了一种新的思路。对分类结果进行分析,确定了各类组合观测量的适用范围,并结合实测数据,利用无几何层叠模糊度解算方法对优选组合进行了整周模糊度的解算,结果验证了该方法的可行性。     

The one‐warehouse multiretailer problem with an order‐up‐to level inventory policy

We consider a two‐level system in which a warehouse manages the inventories of multiple retailers. Each retailer employs an order‐up‐to level inventory policy over T periods and faces an external demand which is dynamic and known. A retailer's inventory should be raised to its maximum limit when replenished. The problem is to jointly decide on replenishment times and quantities of warehouse and retailers so as to minimize the total costs in the system. Unlike the case in the single level lot‐sizing problem, we cannot assume that the initial inventory will be zero without loss of generality. We propose a strong mixed integer program formulation for the problem with zero and nonzero initial inventories at the warehouse. The strong formulation for the zero initial inventory case has only T binary variables and represents the convex hull of the feasible region of the problem when there is only one retailer. Computational results with a state‐of‐the art solver reveal that our formulations are very effective in solving large‐size instances to optimality. © 2010 Wiley Periodicals, Inc. Naval Research Logistics, 2010