变量有界线性目标规划的对偶算法

本文讨论了变量有界的线性目标规划问题,给出了求解这类问题的一个对偶算法,此方法与变量有界线性规划问题的对偶算法相类似。文中证明了算法的有效性,并举例说明了计算过程。     

静磁场Dirichlet问题Galerkin法和牛顿法

作者在［１］,［２］中给出了静磁场Ｄｉｒｉｃｈｌｅｔ问题和Ｎｅｕｍａｎｎ问题广义解的存在与唯一性。本文从理论上给出静磁场Ｄｉｒｉｃｈｌｅｔ问题的一种Ｇａｌｅｒｋｉｎ近似解法,并给出了在各向同性或无电流区情形下的误差估计和牛顿选代序列。     

复合材料圆锥壳稳定性分析的传递函数法

基于线弹性小变形理论， 利用Ｆｏｕｒｉｅｒ级数展开、Ｌａｐｌａｃｅ 变换和摄动方法， 建立了复合材料薄壁圆锥壳的静力响应、频率响应、自由振动与屈曲特征值问题的渐近传递函数解。构造了复杂边界条件、中间带支撑、变锥度及阶梯变厚度圆锥壳的传递函数解。数值计算结果表明该方法具有很高的计算精度。     

一种基于0-1整数规划的全局数据分布优化方法

数据分布是影响并行程序在分布主存多处理机上执行性能的重要因素.针对分布主存多处理机中的数据分布问题,提出了一种基于0-1整数规划、利用数据变换技术进行有效数据分布的方法.该方法通过数据变换技术改变数据的存储布局,以使得数据能被有效地分布,并且该方法还利用数据分布图描述程序被并行的情况及其所含数组被访问的情况,并将全局数据分布优化问题转换为求解数据分布图中最优路径的问题,从而可用0-1整数规划求解最优路径问题.该方法能对多个嵌套循环中具有仿射数组下标的任意维数组进行有效的数据分布,并且也能使嵌套循环的并行度尽可能地大.另外,该方法也考虑了偏移常量的对准问题,从而能使数据通信量尽量地小.实验结果验证了该方法的有效性.     

大整数乘除运算在PC机上的实现

大整数在要求高精度的应用中非常有用.特别是大质数和一般大整数有一个极为重要的应用,就是关于计算机数据加密.在计算机数据加密技术中,常会遇到大整数的算术运算问题.由于所使用的机器和所用语言的限制,大整数的"乘""模"两种运算很难运用高级语言中的"乘""除"运算.提出了一种逐位存储、按字节运算的方法,并用C 实现了大整数的十进制乘除法运算,之后将提出的算法与类似算法的时间复杂度进行了比较,最后给出了算法的运行时间.     

含有p-Laplacian算子的非齐次边值问题正解的存在性

研究非齐次边界条件下,含有p-Laplacian算子的微分方程的可解性,在Banach空间中应用Krasnoselskii不动点定理,得到了边值问题正解存在性结果。     

基于DSP平台的H.324系统研究与实现

在分析H.324系统中双向视音频编解码所需要的运算量和存储容量的基础上,选择两片高速DSP芯片TMS320VC5509,合理分配资源,对视频编解码中关键代码进行优化,设计和实现了双向视音频编解码的实时H.324系统。特别是在定点DSP上采用了整数变换代替浮点DCT,消除了浮点运算,减少了运算量,给出了实验结果。     

New inequalities for finite and infinite group problems from approximate lifting

In this paper, we derive new families of facet‐defining inequalities for the finite group problem and extreme inequalities for the infinite group problem using approximate lifting. The new valid inequalities for the finite group problem include two‐ and three‐slope facet‐defining inequalities as well as the first family of four‐slope facet‐defining inequalities. The new valid inequalities for the infinite group problem include families of two‐ and three‐slope extreme inequalities. These new inequalities not only illustrate the diversity of strong inequalities for the finite and infinite group problems, but also provide a large variety of new cutting planes for solving integer and mixed‐integer programming problems. © 2008 Wiley Periodicals, Inc. Naval Research Logistics, 2008     

A generic model of motor‐carrier fuel optimization

Fuel optimizers are decision models (software products) that are increasingly recognized as effective fuel management tools by U.S. truckload carriers. Using the latest price data of every truck stop, these models calculate the optimal fueling schedule for each route that indicates: (i) which truck stop(s) to use, and (ii) how much fuel to buy at the chosen truck stop(s) to minimize the refueling cost. In the current form, however, these models minimize only the fuel cost, and ignore or underestimate other costs that are affected by the models' decision variables. On the basis of the interviews with carrier managers, truck drivers, and fuel‐optimizer vendors, this article proposes a comprehensive model of motor‐carrier fuel optimization that considers all of the costs that are affected by the model's decision variables. Simulation results imply that the proposed model not only attains lower vehicle operating costs than the commercial fuel optimizers, but also gives solutions that are more desirable from the drivers' viewpoint. © 2008 Wiley Periodicals, Inc. Naval Research Logistics, 2008     

A multi‐stage stochastic programming approach for network capacity expansion with multiple sources of capacity

In networks, there are often more than one sources of capacity. The capacities can be permanently or temporarily owned by the decision maker. Depending on the nature of sources, we identify the permanent capacity, spot market capacity, and contract capacity. We use a scenario tree to model the uncertainty, and build a multi‐stage stochastic integer program that can incorporate multiple sources and multiple types of capacities in a general network. We propose two solution methodologies for the problem. Firstly, we design an asymptotically convergent approximation algorithm. Secondly, we design a cutting plane algorithm based on Benders decomposition to find tight bounds for the problem. The numerical experiments show superb performance of the proposed algorithms compared with commercial software. © 2016 Wiley Periodicals, Inc. Naval Research Logistics 63: 600–614, 2017