Perturbation solution of optimal portfolio theory with transaction costs for any utility function

The solution to the optimal portfolio selection and consumptionrule with small transaction costs is derived via the use ofperturbation analysis for the case when one risky and one risklessasset are available for investment. This methodology allowsus to apply a broader specification for the utility function.     

Multiple feedback at a single-server station

A single server facility is equipped to perform a collection of operations. The service rendered to a customer is a branching process of operations. While the performance of an operation may not be interrupted before its completion, once completed, the required follow-up work may be delayed, at a cost per unit time of waiting that depends on the type and load of work being delayed. Under some probabilistic assumptions on the nature of the required service and on the stream of customers, the problem is to find service schedules that minimize expected costs. The authors generalize results of Bruno [2], Chazan, Konheim and B. Weiss [4], Harrison [8], Klimov [10], Konheim [11], and Meilijson and G. Weiss [13], using a dynamic programming approach.     

有交易费的未定权益无套利定价区间

本文首先给出了有交易费资产模型下套利机会的定义,利用辅助鞅和资产折算函数等方法,讨论了该模型下未定权益无套利定价问题,得到的结果是有交易费的未定权益无套利定价区间.     

Energy and Exergy Analysis, and Thermoeconomic Performance of a BCHP System

Building cooling, heating and power (BCHP) systems should play an important role in achieving the goals of energy efficient use and environment protection in China. It will make big sense when this type of system shows a good performance energetically and economically. An on-site BCHP system being the first in the country was installed and put to use five years ago. As the first step to evaluate the project, com~tations were made based on thermodynamic and themoeconomic theories to evaluate the system on full load and off-design conditions in summer. Discussion and analyses are made mainly in terms of exergetic efficiency and costs of unit amount of useful exergy produced in this paper.     

耕地资源利用的生态外部性价值核算及其补偿研究

 全面准确核算耕地资源利用的生态外部性价值是耕地保护生态补偿的基础,对耕地资源的利用不仅会产生正的生态外部性,还会产生负的生态外部性,如水体污染、土壤重金属污染等,因此核算耕地资源利用的生态外部性价值时,应充分考虑其生态效益和环境成本。采用单位面积当量因子法和资源环境经济学的相关理论和方法,核算了南京市2014年耕地资源利用的生态外部性价值。研究结果表明,2014年南京市耕地资源利用的生态服务价值为55.08亿元;耕地资源利用的环境成本为9.23亿元;生态补偿总价值量为45.85亿元,只占财政收入的2.59%,并不构成财政紧张。对耕地资源利用的生态外部性价值核算旨在正确认识耕地资源利用中的生态效益和环境问题,为制定生态补偿措施提供依据。     

产品生命周期维修费用估算方法研究

基于拆卸逻辑网络模型DLN ,提出了以更换为主要维修方式的单目标维修费用的估算方法和多目标维修费用的计算方法 .在推算产品生命周期维修费用的过程中 ,给出了零部件寿命混合排序法 ,在此基础上计算维修费用以确定维修级别和维修组合 ,以便得出产品生命周期维修路径     

Single item lot-sizing problem for a warm/cold process with immediate lost sales

We consider the dynamic lot-sizing problem with finite capacity and possible lost sales for a process that could be kept warm at a unit variable cost for the next period t + 1 only if more than a threshold value Q_t has been produced and would be cold, otherwise. Production with a cold process incurs a fixed positive setup cost, K_t and setup time, S_t, which may be positive. Setup costs and times for a warm process are negligible. We develop a dynamic programming formulation of the problem, establish theoretical results on the structure of the optimal production plan in the presence of zero and positive setup times with Wagner–Whitin-type cost structures. We also show that the solution to the dynamic lot-sizing problem with lost sales are generated from the full commitment production series improved via lost sales decisions in the presence of a warm/cold process.     

Network design and flow problems with cross-arc costs

Network design and flow problems appear in a wide variety of transportation applications. We consider a new variation to this important class of problems, in which the cost associated with an arc depends not only on the amount of flow moving across that arc, but on the amount of flow on other arcs in the network as well. We formulate an integer program to address this problem, discuss a real-world application in which cross-arc costs are found, and conduct computational experiments on a broad class of problems to analyze how the model performs as network characteristics vary.