标题: | Hedging an option portfolio with minimum transaction lots: A fuzzy goal programming problem |
作者: | Lin, Chang-Chun Liu, Yi-Ting Chen, An-Pin 资讯管理与财务金融系 注:原资管所+财金所 Department of Information Management and Finance |
关键字: | Option portfolio;Greek risks;Hedging;Minimum transaction lots;Fuzzy goal programming |
公开日期: | 十月-2016 |
摘要: | Options are designed to hedge against risks to their underlying assets such as stocks. One method of forming option-hedging portfolios is using stochastic programming models. Stochastic programming models depend heavily on scenario generation, a challenging task. Another method is neutralizing the Greek risks derived from the Black-Scholes formula for pricing options. The formula expresses the option price as a function of the stock price, strike price, volatility, risk-free interest rate, and time to maturity. Greek risks are the derivatives of the option price with respect to these variables. Hedging Greek risks requires no human intervention for generating scenarios. Linear programming models have been proposed for constructing option portfolios with neutralized risks and maximized investment profit. However, problems with these models exist. First, feasible solutions that can perfectly neutralize the Greek risks might not exist. Second, models that involve multiple assets and their derivatives were incorrectly formulated. Finally, these models lack practicability because they consider no minimum transaction lots. Considering minimum transaction lots can exacerbate the infeasibility problem. These problems must be resolved before option hedging models can be applied further. This study presents a revised linear programming model for option portfolios with multiple underlying assets, and extends the model by incorporating it with a fuzzy goal programming method for considering minimum transaction lots. Numerical examples show that current models failed to obtain feasible solutions when minimum transaction lots were considered. By contrast, while the proposed model solved the problems efficiently. (C) 2016 Elsevier B.V. All rights reserved. |
URI: | http://dx.doi.org/10.1016/j.asoc.2016.06.006 http://hdl.handle.net/11536/134218 |
ISSN: | 1568-4946 |
DOI: | 10.1016/j.asoc.2016.06.006 |
期刊: | APPLIED SOFT COMPUTING |
Volume: | 47 |
起始页: | 295 |
结束页: | 303 |
显示于类别: | Articles |