A game theory approach in seller–buyer supply chain

In this paper, several seller–buyer supply chain models are proposed which incorporate both cost factors as well as elements of competition and cooperation between seller and buyer. We assume that unit marketing expenditure and unit price charged by the buyer influence the demand of the product being sold. The relationships between seller and buyer will be modeled by non-cooperative and cooperative games, respectively. The non-cooperative game is based on the Stackelberg strategy solution concept, where we consider separately the case when the seller is the leader (Seller-Stackelberg) and also when the buyer is the leader (Buyer-Stackelberg). Pareto efficient solutions will be provided for the cooperative game model. Numerical examples presented in this paper, including sensitivity analysis of some key parameters, will compare the results between different models considered.     

Warmstarting for interior point methods applied to the long-term power planning problem

The long-term planning of electricity generation in a liberalised market using the Bloom and Gallant model can be posed as a quadratic programming (QP) problem with an exponential number of linear inequality constraints called load-matching constraints (LMCs) and several other linear non-LMCs. Direct solution methods are inefficient at handling such problems and a heuristic procedure has been devised to generate only those LMCs that are likely to be active at the optimiser. The problem is then solved as a finite succession of QP problems with an increasing, though still limited, number of LMCs, which can be solved efficiently using a direct method, as would be the case with a QP interior-point algorithm. Warm starting between successive QP solutions helps then in reducing the number of iterations necessary to reach the optimiser.     

Practical finite‐analytic method for solving differential equations by compact numerical schemes

Methodology for development of compact numerical schemes by the practical finite‐analytic method (PFAM) is presented for spatial and/or temporal solution of differential equations. The advantage and accuracy of this approach over the conventional numerical methods are demonstrated. In contrast to the tedious discretization schemes resulting from the original finite‐analytic solution methods, such as based on the separation of variables and Laplace transformation, the practical finite‐analytical method is proven to yield simple and convenient discretization schemes. This is accomplished by a special universal determinant construction procedure using the general multi‐variate power series solutions obtained directly from differential equations. This method allows for direct incorporation of the boundary conditions into the numerical discretization scheme in a consistent manner without requiring the use of artificial fixing methods and fictitious points, and yields effective numerical schemes which are operationally similar to the finite‐difference schemes. Consequently, the methods developed for numerical solution of the algebraic equations resulting from the finite‐difference schemes can be readily facilitated. Several applications are presented demonstrating the effect of the computational molecule, grid spacing, and boundary condition treatment on the numerical accuracy. The quality of the numerical solutions generated by the PFAM is shown to approach to the exact analytical solution at optimum grid spacing. It is concluded that the PFAM offers great potential for development of robust numerical schemes. © 2008 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq, 2009     

On the subspace L((x ∧ y)m) of Sm(∧2?4)

We take the exterior power ℝ⁴ ∧ ℝ⁴ of the space ℝ⁴, its mth symmetric power V = S ^m (∧²ℝ⁴) = (ℝ⁴ ∧ ℝ⁴) ∨ (ℝ⁴ ∧ ℝ⁴) ∨ ... ∨(ℝ⁴ ∧ ℝ⁴), and put V ₀ = L((x ∧ y)∨ ... ∨(x ∧ y): x, y ∈ ℝ⁴). We find the dimension of V ₀ and an algorithm for distinguishing a basis for V ₀ efficiently. This problem arose in vector tomography for the purpose of reconstructing the solenoidal part of a symmetric tensor field. Original Russian Text Copyright ? 2009 Gubarev V. Yu. The author was supported by the State Maintenance Program for the Leading Scientific Schools of the Russian Federation (Grant NSh-344.2008.1). __________ Novosibirsk. Translated from Sibirskiĭ Matematicheskiĭ Zhurnal, Vol. 50, No. 3, pp. 503–514, May–June, 2009.     

基于不对称需求信息的数量折扣设计

通过建立数量折扣设计优化模型,利用委托代理理论分别分析了完全和不完全需求信息条件下,商品供应商如何为一群异质的零售商制定价格政策,实现其中望利润的最大化.在完全需求信息条件下,单一价格就能使供应商实现利润最大化;而在需求信息为不对称条件下,逆向选择使单一价格失效,此时,数量折扣是一种能够有效增加零售商订货量的激励方式.     

动态供应链网络均衡模型构建与分析

基于单一商品流,考虑了时间变量和库存问题,建立了三层动态供应链网络结构模型.对制造商、零售商和需求市场的多期独立决策行为及其相互作用进行了分析,应用变分不等式构建了各层均衡模型和整个供应链网络均衡模型.最后与相关文献的模型进行了比较.     

Asymptotic distributions of non-central studentized statistics

Let X1,...,Xn be independent and identically distributed random variables and Wn = Wn(X1,...,Xn) be an estimator of parameter θ.Denote Tn =(Wn - θ0)/sn,where sn2 is a variance estimator of Wn.In this paper a general result on the limiting distributions of the non-central studen-tized statistic Tn is given.Especially,when s2n is the jacknife estimate of variance,it is shown that the limit could be normal,a weighted χ2 distribution,a stable distribution,or a mixture of normal and stable distribution.Applicati...     

具有服务水平的差异产品供应链网络均衡模型研究

顾客服务水平已成为当今企业获取较高市场占有率的重要手段。本文考虑了由多个供应商和多个零售商组成的供应链网络模型,通过制造商和零售商提供的服务水平,零售商的订货满足率以及零售价格等因素较为贴切的刻画消费者的选择偏好,利用变分不等式方法分析了制造商、零售商,需求市场以及整个供应链网络均衡条件,并给出了经济解释。最后,通过算例验证了模型的合理性。     

JIT环境下三级供应链供需协调模型研究

模型以整个供应链成本最低为目标,在JIT环境下通过对原材料供应商、制造商和零售商等各阶段库存模型以及其他相关成本的研究,得到供应链的最优物料补充策略,制造商的最优生产策略以及产成品运输策略。供应链结构包括一个制造商,多个原材料供应商和零售商。研究表明,通过有效的加强整条供应链的协作,能够有效降低供应链的总成本。