基于碳交易的闭环供应链碳减排与定价策略研究

在消费者对低碳产品存在偏好的碳交易市场中,研究两级闭环供应链中的减排与定价决策问题.对于制造商负责回收模式下的回收再制造过程,采用指数分布来刻画废旧产品质量水平的不确定性.假设新产品和再制造品存在竞争关系,建立制造商和零售商间的Stackelberg博弈模型,给出制造商确定减排投资和回收参考价格以及零售商决定两种产品的差别定价策略,通过算例分析回收产品的残值和碳交易价格对最优策略和供应链成员利润的影响.研究表明,为了获得利润最大,当碳交易的市场价格升高时,制造商应加大减排投资,且零售商应采取提高产品零售价的策略.     

产需不确定下面向资金约束供应商的供应链融资策略研究

以包含一个供应商和一个分销商的供应链为研究对象,其中分销商面临市场需求不确定性,供应商存在资金约束且面临产出不确定性。 提出期望利率的概念,研究银行贷款期望利率一定的情况下,供应链银行融资最优策略。 构建了供应链预付款融资机制,在此基础上研究预付款模式下供应链的融资与生产订购的最优策略,并讨论了预付款期望利率的可行范围。 研究表明,预付款融资模式下,分销商愿意以低于银行贷款利率的期望利率向供应商提供预付款; 存在预付款期望利率可行区间,实现预付款协调模式下供应链系统的帕累托改进。     

最大Randid指标的k悬挂点化学树的性质

化学分子图G的Randie指标为R（G）=∑wv（dG（u）dG（v））^2/1．其中uv是G的边,dG（u）表示的顶点u的度．本文刻画了具有最大Randie指标的k悬挂点化学树的一些性质．     

供应链系统转变为供需网系统研究

为帮助传统企业顺利转变为供需网企业,提出了供应链系统向供需网系统的转变研究.该研究利用企业节点数据化,通过企业节点的改造及供应链节点与供需网的连接操作达到系统转变的目的.在sc节点数据结构及自身系统功能模块改造的基础上,着重思考了供应链节点连入SDN中的算法思想.通过非线性择优连接方法避免了造成系统易攻击性的枢纽节点的出现.给出了连接算法流程,并以一个示例演示了此连接算法,从中也验证了非线性择优连接的有效性.     

一类非奇异H-矩阵判定的新条件

非奇异H-矩阵是在许多领域具有广泛应用的重要矩阵类,但实际判定一个非奇异H-矩阵是十分困难的.在本文中,我们给出了一类关于非奇异H-矩阵新的判定条件,改进了近期的相关结果,并用数值例子说明了文中结果判定范围的更广泛性.     

Ito 过程在免费邮箱硬盘容量动态分配模型中的应用

分析了目前电子邮箱市场的情况,运用微分方程建立了邮箱用户增长模型,预测某邮箱未来几年内的用户数量及企业需要提供的硬盘容量。从减少成本的角度分析,运用Ito随机过程,对风险进行评估,建立硬盘容量动态分配模型,指导企业如何安排合适的硬盘容量,既能满足市场需要,又达到规避风险和降低成本的目的,提高市场竞争力。     

Links and cubic 3-polytopes

It is well known that a prime link diagram corresponds to a signed plane graph without cut vertices (Kauffman, 1989). In this paper, we present a new relation between prime links and cubic 3-polytopes. Let be the set of links such that each has a diagram whose corresponding signed plane graph is the graph of a cubic 3-polytope. We show that all nontrivial prime links, except -torus links and -pretzel links, can be obtained from by using some operation of untwining. Furthermore, we define the generalized cubic 3-polytope chains and then show that any nontrivial link can be obtained from by some untwining operations, where is the set of links corresponding to generalized cubic 3-polytope chains. These results are used to simplify the computation of the Kauffman brackets of links so that the computing can be done in a unified way for many infinite families of links.

     

How a dominant retailer might design a purchase contract for a newsvendor-type product with price-sensitive demand

A dominant retailer will purchase a newsvendor-type product from a manufacturer, who incurs a unit manufacturing cost k. The expected retail demand is a function of the unit retail price p. How should the retailer design her purchase contract? For this increasingly prevalent but inadequately studied scenario, we propose plausible adaptations of several contract formats that have been widely studied in the dominant-manufacturer context. For both symmetric-k and asymmetric-k-knowledge situations, we present performance results of these contracts. Our results then reveal that the performance of these contract formats under our scenario differs considerably from what one would surmise from the well-known results published for closely related scenarios. For example, the widely studied buyback and revenue-sharing formats turn out to be largely ineffective when implemented by a dominant retailer. In contrast, the two-part tariff format performs well relative to the theoretically optimal “menu of contracts.” Our results highlight the need to study purchase contract formats designed specifically for dominant-retailer newsvendor-product channels.     

Random walks generated by affine mappings

This article is concerned with Markov chains on ^m constructed by randomly choosing an affine map at each stage, and then making the transition from the current point to its image under this map. The distribution of the random affine map can depend on the current point (i.e., state of the chain). Sufficient conditions are given under which this chain is ergodic.     

Minimal surfaces with prescribed topological type on a Schwarzian chain inMc3

Similar to the investigations of unstable polygonal minimal surfaces by Courant [1] we introduce here a variational principle for the free boundary problem with prescribed topological type which produces minimal surfaces in Riemannian manifolds with constant curvature. For special boundary configurations the surfaces have no branch points. The approach can be applied to numerical algorithms since it is constructive.