Solving the Stochastic Growth Model by Linear-Quadratic Approximation and by Value-Function Iteration

This article describes three approximation methods I used to solve the growth model (Model 1) studied by the National Bureau of Economic Research's nonlinear rational-expectations-modeling group project, the results of which were summarized by Taylor and Uhlig (1990). The methods involve computing exact solutions to models that approximate Model 1 in different ways. The first two methods approximate Model 1 about its nonstochastic steady state. The third method works with a version of the model in which the state space has been discretized. A value function iteration method is used to solve that model.     

Duality and local sensitivity analysis in least squares,minimax, and least absolute values regressions

Abstract

This paper deals with the problem of local sensitivity analysis in regression, i.e., how sensitive the results of a regression model (objective function, parameters, and dual variables) are to changes in the data. We use a general formula for local sensitivities in optimization problems to calculate the sensitivities in three standard regression problems (least squares, minimax, and least absolute values). Closed formulas for all sensitivities are derived. Sensitivity contours are presented to help in assessing the sensitivity of each observation in the sample. The dual problems of the minimax and least absolute values are obtained and interpreted. The proposed sensitivity measures are shown to deal more effectively with the masking problem than the existing methods. The methods are illustrated by their application to some examples and graphical illustrations are given.     

基于模糊多分配的辽宁煤炭枢纽站选址研究

提出一种模糊多分配p枢纽站中位问题,其中运输成本定义为模糊变量,问题的目标函数是在给定的可信性水平下,最小化总的运输成本。对于梯形和正态运输成本,问题等价于确定的混合整数线性规划问题。在实证分析中,选取了辽宁省煤炭产业的相关面板数据,分析计算在不同可信度水平下煤炭运输枢纽站设立的数量和位置,再利用传统的优化方法(如分枝定界法)求解。经计算,这一模型和求解方法可以用来解决辽宁省煤炭运输的选址问题。     

Optimal sample coordination using controlled selection

Sample coordination maximizes or minimizes the overlap of two or more samples selected from overlapping populations. It can be applied to designs with simultaneous or sequential selection of samples. We propose a method for sample coordination in the former case. We consider the case where units are to be selected with maximum overlap using two designs with given unit inclusion probabilities. The degree of coordination is measured by the expected sample overlap, which is bounded above by a theoretical bound, called the absolute upper bound, and which depends on the unit inclusion probabilities. If the expected overlap equals the absolute upper bound, the sample coordination is maximal. Most of the methods given in the literature consider fixed marginal sampling designs, but in many cases, the absolute upper bound is not achieved. We propose to construct optimal sampling designs for given unit inclusion probabilities in order to realize maximal coordination. Our method is based on some theoretical conditions on joint selection probability of two samples and on the controlled selection method with linear programming implementation. The method can also be applied to minimize the sample overlap.     

Optimum allocation in multivariate stratified sampling design in the presence of nonresponse with Gamma cost function

In multivariate stratified sample survey with L strata, let p-characteristics are defined on each unit of the population. To estimate the unknown p-population means of each characteristic, a random sample is taken out from the population. In multivariate stratified sample survey, the optimum allocation of any characteristic may not be optimum for others. Thus the problem arises to find out an allocation which may be optimum for all characteristics in some sense. Therefore a compromise criterion is needed to workout such allocation. In this paper, the procedure of estimation of p-population means is discussed in the presence of nonresponse when the use of linear cost function is not advisable. A solution procedure is suggested by using lexicographic goal programming problem. The numerical illustrations are given for its practical utility.     

Frontier estimation using kernel smoothing estimators with data transformation

In economics, a production frontier function is a graph that shows the maximum output of production units such as firms, industries, or economies, as a function of their inputs. Practically, estimating production frontiers often requires imposition of constraints such as monotonicity or monotone concavity. However, few constrained estimators of production frontier have been proposed in the literature. They are based on simple envelopment techniques which often suffer from lack of precision and smoothness. Motivated by this observation, we propose a smooth constrained nonparametric frontier estimator respecting constraints by considering kernel smoothing estimators from a transformed data. It is particularly appealing to practitioners who would like to use smooth estimates that, in addition, satisfy theoretical axioms of production. The utility of this method is illustrated through application to one real dataset and simulation evidences are also presented to show its superiority over the most known methods.     

中小呼叫中心月度排班优化模型与算法

国内中小呼叫中心制定坐席人员月度排班表时,通常考虑劳动法规合同约束和体现企业自身用工管理诉求。构建坐席人员月度排班优化问题的二次整数规划模型。鉴于问题模型难解性,依据调研企业需求和模型逻辑结构分析,把问题分解成三个子问题。通过构建整数规划模型和提出启发式算法来求出子问题解,从而生成排班问题优化解。问题实例计算表明,模型算法能够有效控制人力成本和兼顾员工同班次管理目标。与周排班方法比较,该方法能够充分体现月度排班人力灵活性来实现人力优化配置。     

考虑供应风险的多源应急物资采购双层规划模型

自然灾害频繁发生,事故灾难不断涌现,公共卫生事件猝不及防,社会安全风险交织叠加,给人们的生产和生活带来了巨大的风险和不确定性。在突发事件背景下,考虑应急物资供应中的各类风险,激励多源应急物资的稳定供给,受到党和政府高度重视。应急物资供应有哪些风险,如何规避这些风险,针对多种渠道的采购,如何优化采购结构。这些问题是本论文关注的重点。本文以政府、制造型企业、受灾地区民众为决策主体的三级供应链为基础,构建了上层以整个供应链系统收益最大化为目标函数、下层以供应风险最小化为目标函数的双层规划模型,对不同情景下物资采购订单的分配进行研究。在此基础上,本文以某市洪涝灾害为例进行分析,证明了模型的可行性,并探究了供应风险变化对物资采购订单分配、以及整个供应链系统收益的影响,以期为政府应急物资采购决策提供参考性建议。     

内嵌基因表达式编程及其在函数发现中的应用

为了提高表达效率,提出了新的基因解码方案,形成了内嵌基因表达式编程算法EGEP;提出了极大表达树、嵌套表达树和拼接表达树等概念;分析了基因的表达空间和算法的复杂度。实验表明,该算法提高了函数发现的成功率;在小规模种群的函数中其能力明显优于GEP。在单基因情况下,目标为一元函数和二元函数时,EGEP平均成功辈数分别为GEP算法的25.5%和16.3%;各种规模下,在EGEP算法中二元函数的成功率平均比GEP提高43%以上。     

论高校行政管理工作的科学化

随着知识经济时代的到来和我国高等教育大众化进程的加快,高校的行政管理工作也要随之加强和改善,在管理目标、管理内容、管理原则、管理环节、管理方法等方面走向科学化显得尤为重要。