合约决策条件下的一种二层报童问题模型

考虑到顾客需求和市场价格具有高度的不确定性，供应商和零售商为了回避风险而达到最大的期望利润，双方通常可以采用签订合约的方式来进行决策。为此，我们建立了以供应商为领导层、零售商为从属层的具有合约决策的一个二层报童模型。供应商和零售商可以依据该模型的最优解通过谈判协商确定合约决策变量值以获取较高的期望利润。     

基于服务距离限制和匹配运输的工厂选址问题

研究供应链背景下一种新的工厂选址问题。在考虑一般选址因素的基础之上,着重讨论不同的服务距离限制对工厂选址、工厂车辆分配过程以及运输网络产生的影响。本文中服务距离限制是指对顾客和供应商进行匹配运输的车辆具有的最大配送距离,运输网络采用顾客和供应商匹配方式。根据上述特点构建了一个多阶段线性整数规划模型。采用cp lex软件对模型进行优化求解。最后通过算例说明所建模型的实用性。     

两阶段选址优化问题研究

本文主要考虑如下实际问题:假设选址决策者需要建设p个设施,但是由于资金等等的影响,实际建设时会被要求先建设q个设施,其次再建设p-q个设施(设p>q),同时要求,在建设p-q个设施的时候,已经建设好的q个设施不被删除。本文建立了一个两阶段优化问题,问题的输出是两个待修建的设施的集合Fq,Fp,|Fp|=p,|Fq|=q,且Fq是Fp的子集,问题的目标是最小化这两个设施集合的费用同对应的最优费用的比值的最大值。本文给出一个近似比为9的近似算法,并对一些特殊的情况进行了讨论。所得结论对实际的选址决策具有理论意义,同时也完善已有相关研究结果。     

竞争环境下截流问题的选址-价格模型

研究了竞争环境下考虑产品定价的截流设施选址问题。连锁企业在市场上新建设施时,市场上已有属于竞争对手的设施存在,在连锁企业新建设施位置确定之后,两个企业关于产品定价进行双寡头完全信息非合作博弈。定义了效用函数,引入Huff模型,以企业利润最大为目标,建立双层规划模型,证明了模型纳什均衡价格的存在性,并构造启发式算法对模型进行求解。算例分析表明,该算法求解结果较为理想,可用于大中型网络的规划选址问题。     

有害废弃物处理站选址近似帕累托集合的有效产生

本文研究有害废弃物处理站选址问题。在Ravi等研究的MAX—MIN问题的基础上,考虑了处理站点容量的因素,建立了双目标优化问题,并给出了一个多项式时间算法,该算法能够产生一个（1,ε）一近似帕累托解集合。所得结论对实际的有害废弃物处理站选址决策具有理论意义,同时也完善了已有相关研究结果。     

基于新鲜度下的两级供应商生鲜产品的订货研究

随着冷链物流技术的发展,市场对生鲜产品的需求也越来越大.引入新鲜度函数,研究了需求不确定性对一个包含两级供应商的生鲜产品供应链的决策影响.其中,下游供应商观察市场的需求信息,向上游供应商发送订单;而上游供应商则向其下游供应商提供生鲜产品.发现,下游供应商存在一个最优的订货量使他的期望收益达到最大值.另外,还发现生鲜产品的新鲜度越高,供应商的最优订货量就越大;且存在一个最优的已出产时间,使他的期望收益达到最大.最后,通过数值案例验证了结论的正确性和合理性.     

外部市场存在替代产品的VMI系统研究

供应商管理用户库存(VMI)作为一种有效的补货机制,能对购买渠道的需求信息做出积极正确的反应.现在对VMI的研究往往集中于单个零售商和单个供应商组成的系统,不考虑VMI系统受市场上其他零售商或供应商的影响.假设市场上多个零售商出售相互之间可替代的产品,某个零售商与其供应商之间应用VMI系统.我们的研究主要有两方面:1)VMI系统是否有助于零售商和供应商组成的供应链在差异产品市场上获得更大的收益;2)供应商和零售商如何决策是否应用VMI系统。     

油库选址决策的二层优化模型研究

油库物流设施的选址决策属于战略管理层的决策,它是整个物流系统运作的基础.油库的选址决策是库存和运输决策的基础,库存决策和运输决策则是在整个油品配送系统规划框架内对油库选址决策的完善和延伸.如何进行科学的油库选址是企业所关心的问题.本文将在考虑影响选址的定性成本因素以及运营过程中的非成本因素、定性和定量相结合的基础上利用多层决策理论,将油库选址问题归结为一个二层优化模型,并提出了确定理想选址区域和可行点的相关方法的计算方法.数值实验表明该算法是可行的.本文的结论对实际决策问题具有一定的借鉴作用.     

基于供应商视角的提前订货协调研究

本文针对一个供应商和零售商组成的供应链系统,主要研究零售商如何设计提前订货折扣来吸引顾客提前订货;而供应商如何根据市场需求的不确定性,设计零售商提前订货资金的付款时间等问题。在供应商-Stackelberg框架下,以期望利润为目标,建立了相应的决策模型。通过对模型的分析求解,给出了不同市场环境下供应商要求零售商支付提前订货资金的策略。最后,用算例验证了模型和理论分析的可行性。     

选择机制下的外包服务竞争

本文考虑了一个由一个零售商和若干个供应商组成的供应链系统，其中零售商希望交其面临的市场需求（商品需求或服务）以一固定的价格外包给某一个供应商来实现。供零售商选择的供应商有若干个，他们在零售商给定的选择机制下相互竞争，通过决策服务水平（生产速率）及库存使各自的平均期望利润达到最大。若要求每个供应商的生产速率不得低于需求的到达速率，且按照零售商的选择机制每个供应商被选中的概率与其提供的服务水平成比例，我们证明了此时供应商之间的竞争将达到唯一的纳什均衡。     

On the zeros of a polynomial and its derivatives

If is univariate polynomial with complex coefficients having all its zeros inside the closed unit disk, then the Gauss-Lucas theorem states that all zeros of lie in the same disk. We study the following question: what is the maximum distance from the arithmetic mean of all zeros of to a nearest zero of ? We obtain bounds for this distance depending on degree. We also show that this distance is equal to for polynomials of degree 3 and polynomials with real zeros.

     

On Center Cycles in Grid Graphs

Finding good cycles in graphs is a problem of great interest in graph theory as well as in locational analysis. We show that the center and median problems are NP-hard in general graphs. This result holds both for the variable cardinality case (i.e., all cycles of the graph are considered) and the fixed cardinality case (i.e., only cycles with a given cardinality p are feasible). Hence it is of interest to investigate special cases where the problem is solvable in polynomial time. In grid graphs, the variable cardinality case is, for instance, trivially solvable if the shape of the cycle can be chosen freely. If the shape is fixed to be a rectangle one can analyze rectangles in grid graphs with, in sequence, fixed dimension, fixed cardinality, and variable cardinality. In all cases a complete characterization of the optimal cycles and closed form expressions of the optimal objective values are given, yielding polynomial time algorithms for all cases of center rectangle problems. Finally, it is shown that center cycles can be chosen as rectangles for bounded cardinalities such that the center cycle problem in grid graphs is in these cases completely solved.     

On perturbation of roots of homogeneous algebraic systems

A problem concerning the perturbation of roots of a system of homogeneous algebraic equations is investigated. The question of conservation and decomposition of a multiple root into simple roots are discussed. The main theorem on the conservation of the number of roots of a deformed (not necessarily homogeneous) algebraic system is proved by making use of a homotopy connecting initial roots of the given system and roots of a perturbed system. Hereby we give an estimate on the size of perturbation that does not affect the number of roots. Further on we state the existence of a slightly deformed system that has the same number of real zeros as the original system in taking the multiplicities into account. We give also a result about the decomposition of multiple real roots into simple real roots.

     

A Probabilistic Minimax Location Problem on the Plane

In this paper we consider the weighted minimax (1-center) location problem in the plane when the weights are not given but rather drawn from independent uniform distributions. The problem is formulated and analyzed. For certain parameters of the uniform distributions the objective function is proven to be convex and thus can be easily solved by standard software such as the Solver in Excel. Computational experience is reported.     

A 1-center problem on the plane with uniformly distributed demand points

Center problems or minimax facility location problems are among the most active research areas in location theory. In this paper, we find the best unique location for a facility in the plane such that the maximum expected weighted distance to all random demand points is minimized.     

Reliability problems in multiple path-shaped facility location on networks

In this paper we study a location problem on networks that combines three important issues: (1) it considers that facilities are extensive, (2) it handles simultaneously the location of more than one facility, and (3) it incorporates reliability aspects related to the fact that facilities may fail. The problem consists of locating two path-shaped facilities minimizing the expected service cost in the long run, assuming that paths may become unavailable and their failure probabilities are known in advance. We discuss several aspects of the computational complexity of problems of locating two or more reliable paths on graphs, showing that multifacility path location–with and without reliability issues–is a difficult problem even for 2 facilities and on very special classes of graphs. In view of this, we focus on trees and provide a polynomial time algorithm that solves the 2 unreliable path location problem on tree networks in $O\left(n^2\right)$ time, where $n$ is the number of vertices.     

含有杂质的Ginzburg-Landau泛函的径向极小元

研究了含有杂质的超导体的Ginzburg—Landau模型，给出了Ginzburg—Landau泛函的径向极小元的零点分布，并证明了径向极小元的惟一性。     

The approximation gap for the metric facility location problem is not yet closed

We consider the 1.52-approximation algorithm of Mahdian et al. for the metric uncapacitated facility location problem. We show that their algorithm does not close the gap with the lower bound on approximability, 1.463, by providing a construction of instances for which its approximation ratio is not better than 1.494.     

连续设施选址:模型、方法与应用

给定度量空间和该空间中的若干顾客,设施选址为在该度量空间中确定新设施的位置使得某种目标达到最优。连续设施选址是设施选址中的一类重要问题,其中的设施可在度量空间的某连续区域上进行选址。本文对连续设施选址的模型、算法和应用方面的工作进行了综述。文章首先讨论了连续设施选址中几个重要元素,包括新设施个数、距离度量函数、目标函数;然后介绍了连续选址中的几种经典模型和拓展模型;接着概述了求解连续选址问题的常用优化方法和技术,包括共轭对偶、全局优化、不确定优化、变分不等式方法、维诺图;最后介绍了连续设施选址的重要应用并给出了研究展望。     

The central warehouse location problem revisited

This paper is concerned with the optimal location of a centralwarehouse, given a fixed number and the locations of the localwarehouses. We investigate whether the solution determined bythe traditional model that minimizes total transportation costdiffers from the one determined by a model that also takes intoaccount the inventory and service costs. We build simple modelsto address this question. Numerical results show that ignoringinventory costs in modelling location models may lead to inferiorlocation solutions.