A bivariate mixed policy for a simple repairable system based on preventive repair and failure repair

In this paper, a simple repairable system (i.e. a one-component repairable system with one repairman) with preventive repair and failure repair is studied. Assume that the preventive repair is adopted before the system fails, when the system reliability drops to an undetermined constant R  , the work will be interrupted and the preventive repair is executed at once. And assume that the preventive repair of the system is “as good as new” while the failure repair of the system is not, and the deterioration of the system is stochastic. Under these assumptions, by using geometric process, we present a bivariate mixed policy (R,N)$(R\text{,}N)$, respectively based on a scale of the system reliability and the failure-number of the system. Our aim is to determine an optimal mixed policy (R,N)^∗$(R\text{,}N{)}^{\ast }$ such that the long-run average cost per unit time (i.e. the average cost rate) is minimized. The explicit expression of the average cost rate is derived, and the corresponding optimal mixed policy can be determined analytically or numerically. Finally, a numerical example is given where the working time of the system yields a Weibull distribution. Some comparisons with a certain existing policy are also discussed by numerical methods.     

Knapsack problems with setups

Knapsack problems with setups find their application in many concrete industrial and financial problems. Moreover, they also arise as subproblems in a Dantzig–Wolfe decomposition approach to more complex combinatorial optimization problems, where they need to be solved repeatedly and therefore efficiently. Here, we consider the multiple-class integer knapsack problem with setups. Items are partitioned into classes whose use implies a setup cost and associated capacity consumption. Item weights are assumed to be a multiple of their class weight. The total weight of selected items and setups is bounded. The objective is to maximize the difference between the profits of selected items and the fixed costs incurred for setting-up classes. A special case is the bounded integer knapsack problem with setups where each class holds a single item and its continuous version where a fraction of an item can be selected while incurring a full setup. The paper shows the extent to which classical results for the knapsack problem can be generalized to these variants with setups. In particular, an extension of the branch-and-bound algorithm of Horowitz and Sahni is developed for problems with positive setup costs. Our direct approach is compared experimentally with the approach proposed in the literature consisting in converting the problem into a multiple choice knapsack with pseudo-polynomial size.     

果树种植最佳土地租赁期的数学模型建构

以种植果树为例,根据果树种植的客观规律,引进折扣因子δ=U-α,给出了通过确定投资合同期使利润达到最大的数学模型,并进行了讨论和推广.     

Coordinate Transformation Method for the Extremization of Multiple Integrals

In this paper, we generalize a coordinate transformation method, due to Leitmann (Ref. 1), for free problems in the calculus of variations to analogous problems with multiple integrals.     

Controllability cost of conservative systems: resolvent condition and transmutation

This article concerns the exact controllability of unitary groups on Hilbert spaces with unbounded control operator. It provides a necessary and sufficient condition not involving time which blends a resolvent estimate and an observability inequality. By the transmutation of controls in some time L for the corresponding second-order conservative system, it is proved that the cost of controls in time T for the unitary group grows at most like exp(αL²/T) as T tends to 0. In the application to the cost of fast controls for the Schrödinger equation, L is the length of the longest ray of geometric optics which does not intersect the control region. This article also provides observability resolvent estimates implying fast smoothing effect controllability at low cost, and underscores that the controllability cost of a system is not changed by taking its tensor product with a conservative system.     

A Continuous Location-Allocation Problem with Zone-Dependent Fixed Cost

A zone-dependent fixed cost is introduced within the framework of minisum location of facilities in the continuous space. An efficient algorithm for determining the optimal solution for the single facility location problem is put forward, and its properties are validated. A hypothetical example is given to illustrate the algorithm. Some heuristic procedures are proposed for the multi-facility case with encouraging results.     

手机广告链中移动运营商的努力动机研究与仿真

建立了由单手机广告主、手机广告代理商和移动运营商构成的三级广告产业链之间的基于协作的收益共享契约模型,分析了在以移动运营商为主导的手机广告链中,移动运营商的努力动机受收益共享和努力成本补偿参数的影响.采用量化分析和模拟仿真结合的方法,得出契约参数只有在满足一定条件下,移动运营商所做出的最优努力水平投入决策,将使得整个手机产业链收益最大化,实现多方共赢.     

劳动者行为分析

以边际分析和效用理论研究人的劳动行为,发现人的行为规律性及动力因素与社会偏好的联系,试图对人的一般社会行为研究提供一种定量与定性结合的方法     

Deformation of dispersely failing unidirectional composites

An anisotropic medium is considered in which, upon loading, scattered microdamages accumulate giving rise to nonlinear and residual strains. The damage at a point of the medium is characterized by a scalar function on a unit sphere, referred to as the damage function. This function is approximated by a fourth-rank tensor used for specifying the relation between the increments of strains and stresses. The calculation dependences are presented in detail for a unidirectional composite, which is taken to be a homogeneous transversely isotropic medium. Determination of the unknown constants is illustrated by the example of an actual fiberglass plastic. Institute of Polymer Mechanics, University of Latvia, Riga, LV-1006, Latvia. Translated from Mekhanika Kompozitnykh Materialov, Vol. 35, No. 5, pp. 561–574, September–October, 1999.     

A comprehensive extension of an integrated inventory model with ordering cost reduction and permissible delay in payments

Huang (2010) [1] proposed an integrated inventory model with trade credit financing in which the vendor decides its production lot size while the buyer determines its expenditure to minimize the annual integrated total cost for both the vendor and the buyer. In this paper, we extend his integrated supply chain model to reflect the following four facts: (1) generated sales revenue is deposited in an interest-bearing account for the buyer, (2) the buyer’s interest earned is not always less than or equal to its interest charged, (3) the total number of shipments in one lot size is the vendor’s decision variable to minimize the cost, and (4) it is vital to have a discrimination term which can determine whether the buyer’s replenishment cycle time is less than the permissible delay period or not. We then derive the necessary and sufficient conditions to obtain the optimal solution, and establish some theoretical results to characterize the optimal solution. Finally, numerical examples are presented to illustrate the proposed model and its optimal solution.