我国大病保险区间分段数量的设定

区间分段数是大病保险补偿方案中的一个参数,对参保(合)者个体以及对大病保险基金都有着重要的影响.对各地大病保险中的区间分段的设置进行了总结,证明了在区间等分模式下人均成本随区间分段数单调递增的特点,给出了人均成本的二阶差分表达式,并从数值上分析了人均成本随区间分段数的边际递减性,结果表明,在区间等分模式下,划分4个及以上区间是较优的选择.     

考虑消费者偏好的绿色产品歧视定价决策研究

考虑到消费者对绿色产品和普通产品的偏好程度不同,对消费者的类型进行细分,运用价格歧视理论,构建了绿色产品的歧视定价模型.通过对定价模型进行数值仿真和消费者偏好系数的敏感性分析,分析了消费者细分区间对定价、需求量及利润的影响,并比较了常规定价和歧视定价策略下需求量之间的关系.研究表明:区间需求量与该区间消费者的比例及普通消费者的消费水平正相关,且随着消费者细分区间的增加,绿色产品的区间需求量随之降低,所以,常规定价策略下绿色产品制造商的利润较高;在普通产品的生产成本较小时,普通产品的区间需求量随之增加,歧视定价策略下普通产品制造商的利润较高.     

我国大病保险最优补偿分段方式与区间数量研究

我国大病保险补偿方案制定中,分段的方式以及区间的数量尤为重要.本文在区间等分、等比递增和等比递减三种分段方式下,分别建立以区间数量为自变量,以大病保险补偿额度为因变量的理论模型.以期望补偿比例作为衡量大病保险补偿水平的标准,在不低于95%的期望补偿比例下,理论结果显示:(i)区间等分、等比递增和等比递减三种分段方式对应的最佳区间数量分别为3个、3个和5个;(ii)在设定前述最优区间数量时,区间等比递增模式的补偿水平最高,其次为区间等比递减模式,区间等分模式的补偿水平最低,但是三者相差不大.接着,基于2015年的CHARLS数据为实证,计算三种区间分段方式下,家庭灾难性医疗支出发生率依次为7.13%、7.26%和7.69%,与理论的结果一致.     

我国大病保险最优补偿分段方式与区间数量研究

我国大病保险补偿方案制定中,分段的方式以及区间的数量尤为重要.本文在区间等分、等比递增和等比递减三种分段方式下,分别建立以区间数量为自变量,以大病保险补偿额度为因变量的理论模型.以期望补偿比例作为衡量大病保险补偿水平的标准,在不低于95%的期望补偿比例下,理论结果显示:(i)区间等分、等比递增和等比递减三种分段方式对应的最佳区间数量分别为3个、3个和5个;(ii)在设定前述最优区间数量时,区间等比递增模式的补偿水平最高,其次为区间等比递减模式,区间等分模式的补偿水平最低,但是三者相差不大.接着,基于2015年的CHARLS数据为实证,计算三种区间分段方式下,家庭灾难性医疗支出发生率依次为7.13%、7.26%和7.69%,与理论的结果一致.     

C~k连续的保形分段2k次多项式插值

1．引言在每个子区间上，通过插入至多一个内结点，Brodlie和Butt［1］给出了分段三次多项式保形插值算法，Randal［2］等讨论了分段五次多项式插值，作者［31讨论了一般分段奇次多项式的保形插值，并且给1了内结点的位置范围公式．这种插值方法完全解决了一般的分段奇次多项式的保形插值问题．关于分段偶次多项式的保形插值，大多数文献只讨论分段二次保形插值，这里要特别指出的是Shumake［4j导出了二次样条保凸的充要条件，并且给出了一个二次样条保形插值的方法．在每一个子区间上至多插入一个内结点，则一个二次插值样条就可得到．作…     

分段函数问题的类型及解法

分段函数由于是分段定义的 ,在不同的区间上函数有着不同的对应法则 ,与一般函数有着明显的区别 .学生往往受负迁移影响对分段函数问题认识不清或思维片面产生解题错误 ,本文就分段函数问题的类型进行归类解析 .1　判定分段函数的奇偶性例 1　判定分段函数f (x) =(110 ) x,x >0     

我国大病保险区间分段模式研究

为使大病保险基金稳定运行、确保参保个体享受到足够的保障水平,制定出科学合理的补偿方案是至关重要的.对我国大病保险实务中的区间分段模式进行了总结,并对这5种模式的数学特征进行了探讨,通过极限的方法将这些模式统一在同一个框架之下,举例并对比分析了这些模式的差异,结果显示,区间等分模式优于其它模式,增加区间分段数量可减少过度医疗的发生.     

第二类端点奇异Fredholm积分方程的分数阶退化核方法

本文针对第二类端点奇异Fredholm积分方程构造基于分数阶Taylor展开的退化核方法，设计了两种计算格式，一是在全区间上使用分数阶Taylor展开式近似核函数，二是在包含奇点的小区间上采用分数阶插值，在剩余区间上采用分段二次多项式插值逼近核函数.讨论了两种退化核方法收敛的条件，并给出了混合插值法的收敛阶估计.数值算例表明对于非光滑核函数分数阶退化核方法有着良好的计算效果，且混合二次插值法比全区间上的分数阶退化核方法有着更广泛的适用范围.     

非线性需求下两类价格歧视交互效应的动态博弈分析

在一类非线性需求函数的条件下,基于完全信息动态博弈模型,对两寡头厂商在竞争状态下同时实施二度与三度价格歧视的定价方法进行了研究,讨论了两厂商在面对两个子市场情形下,分别对各子市场的需求区间进行两段分段时的利润最大化问题,得出了在二三度价格歧视下两厂商的均衡产量与分段点,为寡头厂商的生产决策提供了理论依据.     

垄断厂商在固定折扣率条件下的二度价格歧视研究

在线性需求函数的条件下,研究了垄断厂商实行二度价格歧视时确定最优固定折扣率的方法,研究结果表明,如果销售量和分段区间数既定,则最优固定折扣率存在。     

Network DEA pitfalls: Divisional efficiency and frontier projection under general network structures

Data envelopment analysis (DEA) is a method for measuring the efficiency of peer decision making units (DMUs). Recently network DEA models been developed to examine the efficiency of DMUs with internal structures. The internal network structures range from a simple two-stage process to a complex system where multiple divisions are linked together with intermediate measures. In general, there are two types of network DEA models. One is developed under the standard multiplier DEA models based upon the DEA ratio efficiency, and the other under the envelopment DEA models based upon production possibility sets. While the multiplier and envelopment DEA models are dual models and equivalent under the standard DEA, such is not necessarily true for the two types of network DEA models. Pitfalls in network DEA are discussed with respect to the determination of divisional efficiency, frontier type, and projections. We point out that the envelopment-based network DEA model should be used for determining the frontier projection for inefficient DMUs while the multiplier-based network DEA model should be used for determining the divisional efficiency. Finally, we demonstrate that under general network structures, the multiplier and envelopment network DEA models are two different approaches. The divisional efficiency obtained from the multiplier network DEA model can be infeasible in the envelopment network DEA model. This indicates that these two types of network DEA models use different concepts of efficiency. We further demonstrate that the envelopment model’s divisional efficiency may actually be the overall efficiency.     

Allocation of dependent divisional resources

A resource allocation problem is considered with resources that are dependent in the sense that an allocation to an activity requires the application of several resources, except for certain activities which are divisional in the sense that an allocation to such an activity requires the use of only a single resource. Return and cost functions are assumed to be continuous and increasing, and the allocation variables are continuous. Conditions are given for the replacement of the continuous problem by an associated problem with discrete variables and a single constraint, and to a given degree of accuracy. The associated problem can be efficiently solved by dynamic programming. Certain divisional resource allocation problems with discrete variables and several linear constraints are shown to be equivalent to a discrete problem with a single constraint. A numerical example is given.     

黄金分割算法在简支桥梁设计计算中的应用

移动荷载作用下,简支桥梁横截面上弯矩的变化为二元函数Z=f(x,y),本文给出了绝对最大弯矩Zm ax的极值点x*、y*的判别方法:利用数学中的黄金分割算法搜索梁的绝对最大弯矩对应的最危险横截面位置x*;利用力学中的影响线理论判别该截面发生最大弯矩时的最危险荷载位置y*,计算该横截面的最大弯矩得到梁的绝对最大弯矩.该算法易于编写计算程序,以计算机为工具,适用于任意有限多个平行移动荷载在桥梁上移动,对于桥梁的设计计算与安全评估,有一定的实用价值.     

Research on the vehicle routing problem with interval demands

In this paper, a vehicle routing problem with interval demands is investigated based on the motivation of dispatching vehicles to deliver perishable products in practice. A nonlinear interval-based programming method is used to build a model for the vehicle routing problem with interval demands, which assumes that demands of customers are uncertain but fall in given intervals and actual demand of a customer becomes known only when the vehicle visited the customer. A vehicle-coordinated strategy was designed to solve the service failure problem. A hybrid algorithm based on the artificial immune system is also proposed to solve the model for vehicle routing problem with interval demands. The validity of methods and sensitivity analysis are illustrated by conducting some numerical examples. We find that the tolerant possibility degree of interval number has significant impacts on the distances. The planned distance strictly increased, while the additional distance strictly decreased and the total distance after coordinated transport has a U-typed relationship with the tolerant possibility degree of interval number.     

Network DEA: A slacks-based measure approach

Traditional DEA models deal with measurements of relative efficiency of DMUs regarding multiple-inputs vs. multiple-outputs. One of the drawbacks of these models is the neglect of intermediate products or linking activities. After pointing out needs for inclusion of them to DEA models, we propose a slacks-based network DEA model, called Network SBM, that can deal with intermediate products formally. Using this model we can evaluate divisional efficiencies along with the overall efficiency of decision making units (DMUs).     

An inventory system with unit demand and varying ordering levels

An inventory system with unit demand, varying ordering levels and random lead times is considered in this paper. Ordering level is determined by the number of demands during last lead time. The ordering quantity will be such as to bring back the inventory level to S at the ordering epoch. No backlog is permitted. The time dependent probability distribution of the inventory level is obtained. Correlation between the number of demands during a lead time and the length of the next inventory dry period is obtained and it is illustrated by an example.     

Telecommunication Network Capacity Design for Uncertain Demand

The expansion of telecommunication services has increased the number of users sharing network resources. When a given service is highly demanded, some demands may be unmet due to the limited capacity of the network links. Moreover, for such demands, telecommunication operators should pay penalty costs. To avoid rejecting demands, we can install more capacities in the existing network. In this paper we report experiments on the network capacity design for uncertain demand in telecommunication networks with integer link capacities. We use Poisson demands with bandwidths given by normal or log-normal distribution functions. The expectation function is evaluated using a predetermined set of realizations of the random parameter. We model this problem as a two-stage mixed integer program, which is solved using a stochastic subgradient procedure, the Barahona's volume approach and the Benders decomposition.     

Conditions for the existence of continuous schedules of duration five

Each device must perform one operation with each of two demands assigned to it. The assignments are such that the maximum number of operations for one demand equals five, the partial precedence limitations are missing, simultaneous servicing of two or more demands by the same device or of one demand by two or more devices is forbidden, and the duration of each operation equals a unit. The necessary and sufficient conditions are obtained for the existence of a schedule of duration five conforming to the specified assignments and such that each device performs its operations during two consecutive intervals of unit duration. Hence follows the polynomial solvability of the problem under discussion.     

(s, S) Inventory systems with lost sales and Markov renewal demands

In the study of stochastic inventory systems it is generally assumed that the demand epochs are renewable in nature. The present paper deals with a single-item (s, S) inventory model with a finite number of different types of demands, in which the demand epochs form a Markov renewal process. The lead times are exponentially distributed and the demands that occur during stockout periods are not backordered. For this model the transient and limiting inventory level distributions are computed. Also the theory of point processes is used to obtain the mean reorder and shortage rates and their limiting values. For the special case of renewal demands, the problem of minimizing the long-run expected cost rate is analysed.     

A multi-product risk-averse newsvendor with exponential utility function

We consider a multi-product newsvendor using an exponential utility function. We first establish a few basic properties for the newsvendor regarding the convexity of the model and monotonicity of the impact of risk aversion on the solution.When the product demands are independent and the ratio of the degree of risk aversion to the number of products is sufficiently small, we obtain closed-form approximations of the optimal order quantities. The approximations are as easy to compute as the risk-neutral solution. We prove that when this ratio approaches zero, the risk-averse solution converges to the corresponding risk-neutral solution. When the product demands are positively (negatively) correlated, we show that risk aversion leads to lower (higher) optimal order quantities than the solution with independent demands.Using a numerical study, we examine convergence rates of the approximations and thoroughly study the interplay of demand correlation and risk aversion. The numerical study confirms our analytical results and further shows that an increased risk aversion does not always lead to lower order quantities, when demands are strongly negatively correlated.