Determining optimal growth paths in logistics operations

This paper considers a logistics system modelled as a transportation problem with a linear cost structure and lower bounds on supply from each origin and to each destination. We provide an algorithm for obtaining the growth path of such a system, i. e., determining the optimum shipment patterns and supply levels from origins and to destinations, when the total volume handled in the system is increased. Extensions of the procedure for the case when the costs of supplying are convex and piecewise linear and for solving transportation problems that are not in “standard form” are discussed. A procedure is provided for determining optimal plant capacities when the market requirements have prespecified growth rates. A goal programming growth model where the minimum requirements are treated as goals rather than as absolute requirements is also formulated.     

An open expanding economy model

The authors extend the generalized von Neumann model they developed (with J. G. Kemeny) in 1956 to an open model by assuming that there are exogeneously determined export and import prices and that any amount can be exported or imported at these prices. The open model is then characterized by means of seven axioms. It is shown, by applying the theory of linear programming, that if four economically reasonable assumptions hold, the open model has at least one solution in which at least one good with positive export price is exported and at least one good with positive import price is imported. It is also shown that, in general, a continuum of expansion rates can be achieved by varying certain control variables. The choice of these expansion rates gives indirectly the choice of a suitable sub-economy and also determines the exports and imports of the economy. Other results and examples are discussed.     

Time-minimizing transportation problems

A method is given for finding those solutions of a transportation problem which minimize the total time necessary for transporting goods from the suppliers to the consumers. Several extensions of the model are presented.     

A solution for queues with instantaneous jockeying and other customer selection rules

This paper presents a general solution for the M/M/r queue with instantaneous jockeying and r > 1 servers. The solution is obtained in matrices in closed form without recourse to the generating function arguments usually used. The solution requires the inversion of two (Z^r?1) × (2^r?1) matrices. The method proposed is extended to allow different queue selection preferences of arriving customers, balking of arrivals, jockeying preference rules, and queue dependent selection along with jockeying. To illustrate the results, a problem previously published is studied to show how known results are obtained from the proposed general solution.     

纳米级精密机械的设计及特性

最近,Queensgate仪器有限公司研制出一系列超精定位机械,它们将Queensgate的压电及纳米级传感器技术融合为具有亚纳米级定位精度能力的多轴定位控制器。在这篇论文中,将介绍和讨论在这些机械的研制中所用到的一些技术,以解释如何获得纳米或亚纳米级水平的计量能力。     

高速下的外压式空气轴颈轴承研究

本文基于有限元方法,针对不同的速度参数和离心率,采用一种直接的数字方法来计算多孔外压空气轴颈轴承的性能指标,并把模拟结果同参考资料上一种空气心轴轴颈轴承的计算进行了比较。     

Refined prediction for linear regression models

Adequate prediction of a response variable using a multiple linear regression model is shown in this article to be related to the presence of multicollinearities among the predictor variables. If strong multicollinearities are present in the data, this information can be used to determine when prediction is likely to be accurate. A region of prediction, R, is proposed as a guide for prediction purposes. This region is related to a prediction interval when the matrix of predictor variables is of full column rank, but it can also be used when the sample is undersized. The Gorman-Toman ten-variable data is used to illustrate the effectiveness of the region R.