On queueing systems with variable service capacities

In some queueing systems the total service capacity utilized at any given time is a variable under the control of a decision maker. Management doctrines are examined which prescribe the actual service capacity as a function of the queue length and the recent history of the system. Steady state probabilities, expected queue lengths and frequencies of change in capacity are evaluated for a wide class of possible control schemes. Optimization procedures are outlined.     

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

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

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.     

Evaluation of force structures under uncertainty

A model, for assessing the effectiveness of alternative force structures in an uncertain future conflict, is presented and exemplified. The methodology is appropriate to forces (e.g., the attack submarine force) where alternative unit types may be employed, albeit at differing effectiveness, in the same set of missions. Procurement trade-offs, and in particular the desirability of special purpose units in place of some (presumably more expensive) general purpose units, can be addressed by this model. Example calculations indicate an increase in the effectiveness of a force composed of general purpose units, relative to various mixed forces, with increase in the uncertainty regarding future conflicts.     

A simulation–optimization method: Its convergence and utility

An optimization method is given for solving problems where a portion of the explicit mathematical form is unknown but can be evaluated. The solution scheme is an iterative process utilizing optimization and subsystem evaluation (such as via simulation). Conditions for the convergence of the iterative process are given. Several published application articles are noted as using this basic methodology. The method is superior to most other numerical optimization procedures. However, the class of problems for which the method is applicable is restricted to problems with enough known structure to generate a convergent iterative procedure. Three numerical examples are given and comparisons made with several other methods of optimizing unknown systems.     

Equivalence relations in the theory of repetitive consumption

Preference for food in the function of the time since last consumption and total preference in the function of eating frequency are equivalent mathematical representations of attitudes governing food consumption. The observed and postulated properties of these functions imply a formal correspondence between preference maximizing and variety seeking behavior.     

Reformulating zero-sum games with multiple goals

This paper investigates the two-person zero-sum multiple payoff game in which the objective is to minimize a player's total underachievement from a fixed set of goals. It is demonstrated that a previous formulation of this problem can be substantially simplified.     

Optimal ordering policies when anticipating parameter changes in EOQ systems

The classical Economic Order Quantity Model requires the parameters of the model to be constant. Some EOQ models allow a single parameter to change with time. We consider EOQ systems in which one or more of the cost or demand parameters will change at some time in the future. The system we examine has two distinct advantages over previous models. One obvious advantage is that a change in any of the costs is likely to affect the demand rate and we allow for this. The second advantage is that often, the times that prices will rise are fairly well known by announcement or previous experience. We present the optimal ordering policy for these inventory systems with anticipated changes and a simple method for computing the optimal policy. For cases where the changes are in the distant future we present a myopic policy that yields costs which are near-optimal. In cases where the changes will occur in the relatively near future the optimal policy is significantly better than the myopic policy.     

Optimal set partitioning,matchings and lagrangian duality

We formulate the set partitioning problem as a matching problem with simple side constraints. As a result we obtain a Lagrangian relaxation of the set partitioning problem in which the primal problem is a matching problem. To solve the Lagrangian dual we must solve a sequence of matching problems each with different edge-weights. We use the cyclic coordinate method to iterate the multipliers, which implies that successive matching problems differ in only two edge-weights. This enables us to use sensitivity analysis to modify one optimal matching to obtain the next one. We give theoretical and empirical comparisons of these dual bounds with the conventional linear programming ones.