有交易费的套期保值未定权益的最小债券价值量

讨论带交易费的多种股票的市场模型中未定权益的套期保值定价问题,提出折算函数作为总资产的一种较为合理的衡量方式,并来刻画套期保值策略,从而,利用鞅方法和折算函数的性质,得到带交易费套期保值未定权益的最小债券价值量结果。     

带交易费的市场模型和未定权益套期保值

给出了有交易费的且多种股票参与交易的市场模型,并且讨论在此市场模型下的未定权益套期保值问题,在这一模型中,假定仅债券与股票之间有交易,而不同股票之间不直接进行交易以及交易费率是常数。     

辅助鞅下投资消费资产模型的一些基本性质

针对所给出的有交易费的资产模型,引入了资产折算函数,并利用辅助鞅和凸函数对偶方法,讨论了该模型下折算资产优化的性质.     

装备维修保障全资可视化总体结构研究

阐述了全资可视化的基本思想以及我军实现装备维修保障全资可视化的意义 ,以需求分析为基础 ,给出了由系统管理、数据服务、中间处理、客户应用为组成的装备维修保障全资可视化总体结构 ,并对其中的关键技术进行了讨论和分析     

Partial equilibrium in risk‐based production decisions

Characteristically, a small subset of operational problems admit risk neutrality when contingent claims methodology were used in their analysis. That is, for the majority of manufacturing and production problems, operating cash flows are not directly linked to prices of traded assets. However, to the extent that correlations can be estimated, the methodology's applicability to a broader set of operational problems is supported. Our article addresses this issue with the objective of extending the use of contingent claims techniques to a larger set of operational problems. In broad terms, this objective entails a partial equilibrium approach to the problem of valuing uncertain cash flows. To this end, we assume risk aversion and cast our approach within Merton's intertemporal capital asset pricing model. In this context, we formulate a “generic” production valuation model that is framed as an exercise in stochastic optimal control. The model is versatile in its characterization and can easily be adapted to accommodate a wide‐ranging set of risk‐based operational problems where the underlying sources of uncertainty are not traded. To obtain results, the model is recast as a stochastic dynamic program to be solved numerically. The article addresses a number of fundamental issues in the analysis risk based decision problems in operations. First, in the approach provided, decisions are analyzed under a properly defined risk structure. Second, the process of analysis leads to suitably adjusted probability distributions through which, appropriately discounted expectations are derived. Third, through consolidating existing concepts into a standard and adaptable framework, we extend the applicability of contingent claims methodology to a broader set of operational problems. The approach is advantageous as it obviates the need for exogenously specifying utility functions or discount rates.© 2011 Wiley Periodicals, Inc. Naval Research Logistics, 2011     

Cost allocation of capacity investment games

Consider a manufacturer serving a set of retail stores each of which faces deterministic demands in a finite planning horizon. At the beginning of the planning horizon, the production capacity of the manufacturer is built, followed by production, outsourcing to third party manufacturers if necessary and distribution to the retail stores. Because the retail stores are usually managed by different managers who act as independent profit centers, it is desirable that the total cost is divided among the retail stores so that their incentives can be appropriately captured and thus efficient operations can be achieved. Under various conditions, we prove that there is a fair allocation of costs among the retail stores in the sense that no subset of retail stores subsidizes others, or equivalently, the resulting capacity investment game has a nonempty core, that is, the capacity investment game is a balanced game. In addition, our proof provides a mechanism to compute a fair cost allocation. © 2013 Wiley Periodicals, Inc. Naval Research Logistics 60: 512–523, 2013     

Bayesian selling problem with partial information

We introduce an optimal stopping problem for selling an asset when the fixed but unknown distribution of successive offers is from one of n possible distributions. The initial probabilities as to which is the true distribution are given and updated in a Bayesian manner as the successive offers are observed. After receiving an offer, the seller has to decide whether to accept the offer or continue to observe the next offer. Each time an offer is observed a fixed cost is incurred. We consider both the cases where recalling a past offer is allowed and where it is not allowed. For each case, a dynamic programming model and some heuristic policies are presented. Using simulation, the performances of the heuristic methods are evaluated and upper bounds on the optimal expected return are obtained. © 2013 Wiley Periodicals, Inc. Naval Research Logistics, 2013