On the manipulation of transfer prices in a static environment

In a static environment, J. Hirschleifer's marginal cost solution to the transfer pricing problem is commonly accepted as analytically correct. However, actual pricing practice within Western corporations and socialist-planned economies generally deviates from marginal cost pricing. Some form of average cost pricing is more commonly chosen. Recently in this journal, H. Enzer has claimed to show that some form of average cost pricing is indeed the analytically correct solution to the transfer pricing problem when choice of technique and manipulation are allowed. Enzer claims that optimal decisions made by each of two divisions according to their individual self-interests are made compatible with overall firm optimization when the transfer price assigned to the internally-transferred commodity is any form of average cost. We show that the marginal cost solution is correct for Enzer's problem in the absence of manipulation by either division. Indeed, this was all that Hirschleifer claimed. In the process, we uncover a fundamental mathematical error in Enzer's argument. When manipulation of the transfer price by divisions is allowed, we demonstrate the faults with Enzer's average cost solution and conclude Hirschleifer's original statements on manipulation to be correct even in Enzer's environment. A final section briefly indicates the importance to the transfer pricing problem of a growing body of economic literature on incentive structures.     

Benders' partitioning scheme applied to a new formulation of the quadratic assignment problem

In this paper we present a new formulation of the quadratic assignment problem. This is done by transforming the quadratic objective function into a linear objective function by introducing a number of new variables and constraints. The resulting problem is a 0-1 linear integer program with a highly specialized structure. This permits the use of the partitioning scheme of Benders where only the original variables need be considered. The algorithm described thus iterates between two problems. The master problem is a pure 0-1 integer program, and the subproblem is a transportation problem whose optimal solution is shown to be readily available from the master problem in closed form. Computational experience on problems available in the literature is provided.     

Two heuristics for the economic lot scheduling problem: An experimental study

In this article we present and test two heuristics for the economic lot scheduling problem. The first heuristic was developed by one of us (P.C. Geng) during Ph.D. research, while the other is a convergent implementation of an algorithm due to Doll and Whybark. We study the performance of these heuristics on a large set of test problems constructed using a new form of problem generation that yields random problems within an experimental design.     

一种新型的目标分配形式及算法

提出了一种新型的目标分配形式--顺序攻击目标分配形式,并以地空导弹拦截攻击机机群为研究对象,给出了均匀目标分配形式和顺序攻击目标分配形式,以及在机群无干扰武器和有干扰武器状态下,地空导弹拦截效果的算法模型.数值分析表明,顺序攻击目标分配形式有较好的攻击效果.     

虚拟维修技术在军械保障训练中的应用

首先介绍了当前装备维修训练中存在的问题和虚拟现实技术及其运用在装备维修训练上所产生的巨大效益 ,然后给出了虚拟维修本身的特点及应满足的要求 ,最后给出了三维建模的规则和人机工程学的实施途径、方法及“沉浸”感的几种实现方法     

机器人操作空间加速度信号应用研究

机器人力控制存在着动力学不稳定性问题，即系统响应速度和稳定性之间的矛盾。在操作空间一级引人加速度正反馈，既能使系统的响应频带变宽，又能提高系统阻尼。这种方法能有效地提高机器人对高刚度环境的适应性，使力控制的动力学不稳定性问题得到明显地缓和；另外本文研究了用加速度积分信号代替位置差分速度信号来消除差分噪声，提高力控制精度方法的应用前景。     

TTT transforms and age replacements with discounted costs

The ordinary age replacement problem consists of finding an optimal age at which a unit, needed in a continuous production process, should be replaced in order to minimize the average long-run cost per unit time. Bergman introduced a graphical procedure based on the total-time-on-test (TTT) concept for the analysis of the age replacement problem. In this article, that idea is generalized to the situation of discounted costs. We also study a more general age replacement problem in which we have a form of imperfect repair.     

关于排水型两栖车辆水上航速的研究

本文引入造船学的有关理论,从理论和实验基础上研究履带式排水型两栖车辆水上航行所遇到的阻力,以形状阻力和兴波阻力为主.高速航行时,兴波阻力上升为主要阻力成份,它是阻碍排水型两栖车辆水上航速提高的主要原因,由此文中提出了排水型两栖车辆水上实用极限速度问题.     

Composite unimodality

This article defines a class of univariate functions termed composite unimodal, and shows how their minimization admits an effective search procedure, albeit one not as efficient as is Fibonacci search for unimodal functions. An approximate Lagrangian approach to an important real-world logistics problem is seen to yield a surrogate problem whose objective function is composite unimodal. The mathematical form of this objective function is likely to be encountered in solving future real-world problems. © 1993 John Wiley & Sons, Inc.     

A primal simplex algorithm to solve a rectilinear distance facility location problem

This paper considers the problem of locating m new facilities in the plane so as to minimize a weighted rectangular distance between the new facilities and n existing facilities. A special purpose primal simplex algorithm is developed to solve this problem. The algorithm will maintain at all times a basis of dimension m by m; however, because of the triangularity of the basis matrix, it will not be necessary to form a basis inverse explicitly.     

梯格形自适应控制

本文讨论并解决了具有d步时延的多变量系统的梯格形自适应控制问题。为此,把自适应控制下的闭环系统嵌入到ARMA模型中,采用梯格算法进行预报。为了考虑d步时延控制系统,采用简捷方法推导了d步梯格预报公式,并给出了控制量的确定方法。采用梯格形自适应控制可方便地调节模型的阶次,从而可以克服对象阶次不准引起的自适应控制失效的问题。     

An extension of the (szwarc) truck assignment problem

In this journal in 1967. Szware presented an algorithm for the optimal routing of a common vehicle fleet between m sources and n sinks with p different types of commodities. The main premise of the formulation is that a truck may carry only one commodity at a time and must deliver the entire load to one demand area. This eliminates the problem of routing vehicles between sources or between sinks and limits the problem to the routing of loaded trucks between sources and sinks and empty trucks making the return trip. Szwarc considered only the transportation aspect of the problem (i. e., no intermediate points) and presented a very efficient algorithm for solution of the case he described. If the total supply is greater than the total demand, Szwarc shows that the problem is equivalent to a (mp + n) by (np + m) Hitchcock transportation problem. Digital computer codes for this algorithm require rapid access storage for a matrix of size (mp + n) by (np + m); therefore, computer storage required grows proportionally to p². This paper offers an extension of his work to a more general form: a transshipment network with capacity constraints on all arcs and facilities. The problem is shown to be solvable directly by Fulkerson's out-of-kilter algorithm. Digital computer codes for this formulation require rapid access storage proportional to p instead of p². Computational results indicate that, in addition to handling the extensions, the out-of-kilter algorithm is more efficient in the solution of the original problem when there is a mad, rate number of commodities and a computer of limited storage capacity.     

The use of dynamic programming methodology for the solution of a class of nonlinear programming problems

This paper presents an application of a method for finding the global solution to a problem in integers with a separable objective function of a very general form. This report shows that there is a relationship between an integer problem with a separable nonlinear objective function and many constraints and a series of nonlinear problems with only a single constraint, each of which can be solved sequentially using dynamic programming. The first solution to any of the individual smaller problems that satisfies the original constraints in addition, will be the optimal solution to the multiply-constrained problem.     

一类带配送中心运输问题的容量扩张模型研究

运输问题一般采用表上作业法来解决,考虑一类带配送中心的运输问题,若仍采用表上作业法,会使问题复杂化.文中采用一种构造辅助网络的方法:在运输网络中将每个配送中心均拆分成两个点,连接两点形成新弧,构造出新的网络,并给每条弧赋予参数,将此类运输问题转换为最小费用流模型来解决,可以使问题模型和运算简单化.在此基础上,考虑运输网络中配送中心和边的容量扩张问题.     

基于扩展卡尔曼滤波的机动目标航迹跟踪

针对高速飞行目标航迹跟踪问题,进行了扩展卡尔曼滤波的曲线拟和仿真试验研究.首先建立目标跟踪的数学模型,确定了系统对应的参数及状态方程,进而将线性卡尔曼滤波器进行扩展,将函数形式的滤波模型在函数自变量估计值附近进行泰勒级数展开,求导获得相应雅克比矩阵,在获得观测及系统误差的基础上,得到针对此问题的扩展卡尔曼滤波方程.仿真结果表明该方法的有效性.     

基于 Petri 网的决策组织结构设计

决策组织设计的首要问题是如何获得可行的组织结构。决策组织作为典型的分布式智能系统,利用Ｐｅｔｒｉ网生成其可行的组织结构是极广泛采用的方法,并已取得很多成果。该文是对这一领域的过去、现在和未来的综述。     

Statistical decision analysis of stochastic linear programming problems

This paper presents a statistical decision analysis of a one-stage linear programming problem with deterministic constraints and stochastic criterion function. Procedures for obtaining numerical results are given which are applicable to any problem having this general form. We begin by stating the statistical decision problems to be considered, and then discuss the expected value of perfect information and the expected value of sample information. In obtaining these quantities, use is made of the distribution of the optimal value of the linear programming problem with stochastic criterion function, and so we discuss Monte Carlo and numerical integration procedures for estimating the mean of this distribution. The case in which the random criterion vector has a multivariate Normal distribution is discussed separately, and more detailed methods are offered. We discuss dual problems, including some relationships of this work with other work in probabilistic linear programming. An example is given in Appendix A showing application of the methods to a sample problem. In Appendix B we consider the accuracy of a procedure for approximating the expected value of information.     

On a constraint qualification in a nondifferentiable programming problem

A mathematical programming problem with an objective function containing the square root of a positive semidefinite quadratic form has been considered by Mond. In order to use a transposition theorem of Eisenberg, Mond introduces a complicated constraint qualification. In this note we give a simple geometric characterization to this constraint qualification and show that it is implied by the generalized Slater constraint qualification.     

Towards the revision of the 1977 Organisation of African Unity/African Union Convention on the Elimination of Mercenarism in Africa

The revision of the 1977 Organisation of African Unity's Convention on the Elimination of Mercenarism in Africa (Mercenary Convention) is now long overdue. The existence of the Mercenary Convention has over the years failed to eliminate mercenarism in Africa, among others as a result of the manner in which it defines a ‘mercenary’. The problem is exacerbated by the rapid growth of the private security sector in the form of the private military/security company (PMSC), which to a large extent arguably represents a new form of ‘mercenary’ outfit that is technically not covered by the Mercenary Convention. Because the Mercenary Convention was adopted during a different epoch in African history there is now a need to take stock of its successes and failures and determine how it can best be revised to address the new security challenges in Africa. In this contribution the need for the revision of the Mercenary Convention is discussed. Given the difficulties and challenges presented by the Mercenary Convention, the contribution advocates the drafting of two conventions, one focusing on the regulation of PMSCs and the other focusing on the elimination of mercenarism in Africa.     

多向嵌套循环的 FMS并行执行模式

基于小粒度并行结构的分类,提出了结构范式的概念。在此基础上,探讨了多向嵌套循环的并行执行问题,提出了父、母、子进程的概念以及面向多向嵌套循环的FMS 处理机调度策略