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.     

The queueing system MX/G/1 and its ramifications

This paper deals with the bulk arrival queueing system M^X/G/1 and its ramifications. In the system M^X/G/1, customers arrive in groups of size X (a random variable) by a Poisson process, the service times distribution is general, and there is a single server. Although some results for this queueing system have appeared in various books, no unified account of these, as is being presented here, appears to have been reported so far. The chief objectives of the paper are (i) to unify by an elegant procedure the relationships between the p.g.f.'s

     

Interval estimation of a global optimum for large combinatorial problems

Consider an “intractable” optimization problem for which no efficient solution technique exists. Given a systematic procedure for generating independent heuristic solutions, we seek to obtain interval estimates for the globally optimal solution using statistical inference. In previous work, accurate point estimates have been derived. Determining interval estimates, however, is a considerably more difficult task. In this paper, we develop straightforward procedures which compute confidence intervals efficiently in order to evaluate heuristic solutions and assess deviations from optimality. The strategy presented is applicable to a host of combinatorial optimization problems. The assumptions of our model, along with computational experience, are discussed.     

Explicit steady state solutions for a particular M(x)/M/1 queueing system

An explicit steady state solution is determined for the distribution of the number of customers for a queueing system in which Poisson arrivals are bulks of random size. The number of customers per bulk varies randomly between 1 and m, m arbitrary, according to a point multinomial, and customer service is exponential. Queue characteristics are given.     

Flowshop sequencing problem with ordered processing time matrices: A general case

The ordered matrix flow shop problem with no passing of jobs is considered. In an earlier paper, the authors have considered a special case of the problem and have proposed a simple and efficient algorithm that finds a sequence with minimum makespan for a special problem. This paper considers a more general case. This technique is shown to be considerably more efficient than are existing methods for the conventional flow shop problems.     

直接序列扩频码元同步的快速捕获及跟踪

讨论基于软件无线电技术的直接序列扩频码元捕获及跟踪的快速算法。利用伪随机序列尖锐的自相关特性,通过计算中频接收信号与本地匹配滤波器的循环相关完成码元捕获,提出了循环相关的两种快速算法,并分析了正确捕获概率及平均捕获时间,最后给出码元跟踪的简便算法及精度。仿真及实验验证了所述算法的正确性和有效性,特别适用于信噪比较低、对设备体积及功耗限制严格的通信系统中。     

基于软件无线电的DS/SS载频跟踪方法

扩频序列的精确同步是接收机正确解扩的关键问题。提出一种基于软件无线电技术,对DS/SS载频偏移量实现快速跟踪的数值算法,并讨论了实现步骤及估计性能。该算法具有三个优点:(1)可消除载频初始相位的影响。(2)适于极低信噪比条件下的载波跟踪。(3)算法简便,易于实现。仿真及实验均验证了此算法的可行性。