基于串联两阶段网络DEA模型的供应链规模收益分析

数据包络分析(DEA)是评价供应链系统(Supply chain system)间相对有效性的一种重要的工具,但是传统的DEA不考虑供应链的内部结构,对系统效率评价偏高;而本文所研究两阶段串联供应链系统,考虑把部分中间产品作为最终产品输出,增加额外中间投入的情形.基于所提出的供应链系统结构,本文建立相应的串联结构下的网络DEA模型,并针对所建立模型进行相关理论的研究,给出了串联结构下的生产可能集和规模收益情况判定方法.最后,进行数值实验,以验证我们提出的结论.     

Banach空间二阶非线性微分方程的弱Carathéodory解

本文定义了二阶微分方程的弱 Carathéodory解 ,在不涉及紧型条件的情形下 ,直接用迭代法证明了 Banach空间二阶非线性常微分方程两点边值问题存在唯一解 ,并给出逼近解迭代序列的误差估计 ,对周期边值问题得到类似的结果     

Necessary Conditions for Differentiability of Distance Functions

Necessary conditions for the Gâteaux differentiability of the distance function to a set are considered. A series of characterizing results is obtained.     

On the duration of the total eclipse of a satellite of a body

This paper solves the problem of the duration of the total eclipseof a satellite of a body, provided that (a) the body is sphericalin shape and the mass distribution inside the body is sphericallysymmetrical; (b) the satellite is a very small object; (c) thesatellite's orbit around a body is circular and the satellitecan pass through the centre of its shadow; (d) a source of lightis the source of the conical body's shadow (umbra) and it doesnot change its apparent position in the sky; (e) there are noperturbations on the satellite's orbit. The solution presentedrepresents the general discussion of the problem based on utilizationof some parts of the theory of contraction mappings.     

Maximizing a Linear Fractional Function on a Pareto Efficient Frontier

We consider the problem of maximizing a linear fractional function on the Pareto efficient frontier of two other linear fractional functions. We present a finite pivoting-type algorithm that solves the maximization problem while computing simultaneously the efficient frontier. Application to multistage efficiency analysis is discussed. An example demonstrating the computational procedure is included.     

The push-out region of an immersed manifold

We consider immersions: and construct a subspace of which corresponds to a set of embedded manifolds which are either parallel to f, tubes around f or, in general, partial tubes around f. This space is invariant under the action of the normal holonomy group, We investigate the case where is non-trivial and obtain some results on the number of connected components of . Received 24 March 2000.     

Large set of P3‐decompositions

Let G=(V(G),E(G)) be a graph. A (n,G, λ)‐GD is a partition of the edges of λK_n into subgraphs (G‐blocks), each of which is isomorphic to G. The (n,G,λ)‐GD is named as graph design for G or G‐decomposition. The large set of (n,G,λ)‐GD is denoted by (n,G,λ)‐LGD. In this work, we obtain the existence spectrum of (n,P₃,λ)‐LGD. © 2002 Wiley Periodicals, Inc. J Combin Designs 10: 151–159, 2002; Published online in Wiley InterScience ( www.interscience.wiley.com ). DOI 10.1002/jcd.10008     

Regular population monotonic allocation schemes

The paper introduces a refinement of the notion of population monotonic allocation scheme, called regular population monotonic allocation scheme (regularpmas). This refinement is based on economic situations in which players may have to select new partners from a set of potential players and in which there exist certain capacity constraints. A sufficient condition for the existence of a regularpmas is given. For the class of games with regularpmas, we prove that the core coincides with the Davis and Maschler and the Mas-Colell bargaining sets.     

非线性奇异边值问题的正解

利用锥映射的不动点指数定量，研究了一类非线性奇异边值问题多个正解的存在性问题。在构造的解的存在条件之下，证明了奇异边值问题至少有两个正解的存在性定理。