A Stochastic Programming Model for Currency Option Hedging

In this paper we use a stochastic programming approach to develop currency option hedging models which can address problems with multiple random factors in an imperfect market. The portfolios considered in our model are rebalanced at the end of each time period, and reinvestments are allowed during the hedging process. These sequential decisions (reinvestments) are based on the evolution of random parameters such as exchange rates, interest rates, etc. We also allow the inclusion of a variety of instruments in the hedging portfolio, including short term derivative securities, short term options, and futures. These instruments help generate strategies that provide good liquidity and low trade intensity. One of the important features of the model is that it incorporates constraints on sensitivity measures such as Delta and Gamma. By ensuring that these hedge parameters track a desired trajectory (e.g., the parameters of a target option), the new model provides investment strategies that are robust with respect to the perturbations measured by Delta and Gamma. In order to manage the explosion of scenarios due to multiple random factors, we incorporate sampling within a scenario aggregation algorithm. We illustrate that when compared with other myopic hedging methods in imperfect markets, the new stochastic programming model can provide better performance. Our examples also illustrate stochastic programming as a practical computational tool for realistic hedging problems.     

A mixed R&D projects and securities portfolio selection model

The business environment is full of uncertainty. Allocating the wealth among various asset classes may lower the risk of overall portfolio and increase the potential for more benefit over the long term. In this paper, we propose a mixed single-stage R&D projects and multi-stage securities portfolio selection model. Specifically, we present a bi-objective mixed-integer stochastic programming model. Moreover, we use semi-absolute deviation risk functions to measure the risk of mixed asset portfolio. Based on the idea of moments approximation method via linear programming, we propose a scenario generation approach for the mixed single-stage R&D projects and multi-stage securities portfolio selection problem. The bi-objective mixed-integer stochastic programming problem can be solved by transforming it into a single objective mixed-integer stochastic programming problem. A numerical example is given to illustrate the behavior of the proposed mixed single stage R&D projects and multi-stage securities portfolio selection model.     

Options strategies for international portfolios with overall risk management via multi-stage stochastic programming

This paper proposes a multi-stage stochastic programming model to explore optimal options strategies for international portfolios with overall risk management on Greek letters, extending existing Greek-based analysis to dynamic and nondeterministic programming under uncertainty. The contribution to the existing literature are overall control on the time-varying Greek letters, state-contingent decision dynamics in consistent with the projected outcomes of the changing information, and a holistic view for optimizing the portfolio of assets and options. Empirical results show the model possesses considerable benefits in terms of larger profit margins, greater stability of returns and higher hedging efficiency compared to traditional methods.     

Scenario generation and stochastic programming models for asset liability management

In this paper, we develop and test scenario generation methods for asset liability management models. We propose a multi-stage stochastic programming model for a Dutch pension fund. Both randomly sampled event trees and event trees fitting the mean and the covariance of the return distribution are used for generating the coefficients of the stochastic program. In order to investigate the performance of the model and the scenario generation procedures we conduct rolling horizon simulations. The average cost and the risk of the stochastic programming policy are compared to the results of a simple fixed mix model. We compare the average switching behavior of the optimal investment policies. Our results show that the performance of the multi-stage stochastic program could be improved drastically by choosing an appropriate scenario generation method.     

Multi-stage portfolio selection problem with dynamic stochastic dominance constraints

We study the multi-stage portfolio selection problem where the utility function of an investor is ambiguous. The ambiguity is characterized by dynamic stochastic dominance constraints, which are able to capture the dynamics of the random return sequence during the investment process. We propose a multi-stage dynamic stochastic dominance constrained portfolio selection model, and use a mixed normal distribution with time-varying weights and the K-means clustering technique to generate a scenario tree for the transformation of the proposed model. Based on the scenario tree representation, we derive two linear programming approximation problems, using the sampling approach or the duality theory, which provide an upper bound approximation and a lower bound approximation for the original nonconvex problem. The upper bound is asymptotically tight with infinitely many samples. Numerical results illustrate the practicality and efficiency of the proposed new model and solution techniques.

     

Financial scenario generation for stochastic multi-stage decision processes as facility location problems

The quality of multi-stage stochastic optimization models as they appear in asset liability management, energy planning, transportation, supply chain management, and other applications depends heavily on the quality of the underlying scenario model, describing the uncertain processes influencing the profit/cost function, such as asset prices and liabilities, the energy demand process, demand for transportation, and the like. A common approach to generate scenarios is based on estimating an unknown distribution and matching its moments with moments of a discrete scenario model. This paper demonstrates that the problem of finding valuable scenario approximations can be viewed as the problem of optimally approximating a given distribution with some distance function. We show that for Lipschitz continuous cost/profit functions it is best to employ the Wasserstein distance. The resulting optimization problem can be viewed as a multi-dimensional facility location problem, for which at least good heuristic algorithms exist. For multi-stage problems, a scenario tree is constructed as a nested facility location problem. Numerical convergence results for financial mean-risk portfolio selection conclude the paper.     

Probability maximization models for portfolio selection under ambiguity

This paper considers several probability maximization models for multi-scenario portfolio selection problems in the case that future returns in possible scenarios are multi-dimensional random variables. In order to consider occurrence probabilities and decision makers’ predictions with respect to all scenarios, a portfolio selection problem setting a weight with flexibility to each scenario is proposed. Furthermore, by introducing aspiration levels to occurrence probabilities or future target profit and maximizing the minimum aspiration level, a robust portfolio selection problem is considered. Since these problems are formulated as stochastic programming problems due to the inclusion of random variables, they are transformed into deterministic equivalent problems introducing chance constraints based on the stochastic programming approach. Then, using a relation between the variance and absolute deviation of random variables, our proposed models are transformed into linear programming problems and efficient solution methods are developed to obtain the global optimal solution. Furthermore, a numerical example of a portfolio selection problem is provided to compare our proposed models with the basic model.     

Multi-objective stochastic programming for portfolio selection

Generally, in the portfolio selection problem the Decision Maker (DM) considers simultaneously conflicting objectives such as rate of return, liquidity and risk. Multi-objective programming techniques such as goal programming (GP) and compromise programming (CP) are used to choose the portfolio best satisfying the DM’s aspirations and preferences. In this article, we assume that the parameters associated with the objectives are random and normally distributed. We propose a chance constrained compromise programming model (CCCP) as a deterministic transformation to multi-objective stochastic programming portfolio model. CCCP is based on CP and chance constrained programming (CCP) models. The proposed program is illustrated by means of a portfolio selection problem from the Tunisian stock exchange market.     

Introduction to financial optimization: Mathematical Programming Special Issue

Optimization models are effective for solving significant problems in finance, including long-term financial planning and other portfolio problems. Prominent examples include: asset-liability management for pension plans and insurance companies, integrated risk management for intermediaries, and long-term planning for individuals. Several applications will be briefly mentioned. Three distinct approaches are available for solving multi-stage financial optimization models: 1) dynamic stochastic control, 2) stochastic programming, and 3) optimizing a stochastic simulation model. We briefly review the pros and cons of these approaches, discuss further applications of financial optimization, and conclude with topics for future research. Published online December 15, 2000     

Utility-based indifference pricing in regime-switching models

In this paper, we study utility-based indifference pricing and hedging of a contingent claim in a continuous-time, Markov, regime-switching model. The market in this model is incomplete, so there is more than one price kernel. We specify the parametric form of price kernels so that both market risk and economic risk are taken into account. The pricing and hedging problem is formulated as a stochastic optimal control problem and is discussed using the dynamic programming approach. A verification theorem for the Hamilton-Jacobi-Bellman (HJB) solution to the problem is given. An issuer’s price kernel is obtained from a solution of a system of linear programming problems and an optimal hedged portfolio is determined.     

Robust portfolio selection based on a multi-stage scenario tree

The aim of this paper is to apply the concept of robust optimization introduced by Bel-Tal and Nemirovski to the portfolio selection problems based on multi-stage scenario trees. The objective of our portfolio selection is to maximize an expected utility function value (or equivalently, to minimize an expected disutility function value) as in a classical stochastic programming problem, except that we allow for ambiguities to exist in the probability distributions along the scenario tree. We show that such a problem can be formulated as a finite convex program in the conic form, on which general convex optimization techniques can be applied. In particular, if there is no short-selling, and the disutility function takes the form of semi-variance downside risk, and all the parameter ambiguity sets are ellipsoidal, then the problem becomes a second order cone program, thus tractable. We use SeDuMi to solve the resulting robust portfolio selection problem, and the simulation results show that the robust consideration helps to reduce the variability of the optimal values caused by the parameter ambiguity.     

Operator trigonometry of multivariate finance

We inquire into an operator-trigonometric analysis of certain multi-asset financial pricing models. Our goal is to provide a new geometric point of view for the understanding and analysis of such financial instruments. Among those instruments which we examine are quantos for currency hedging, spread options for multi-asset pricing, portfolio rebalancing under stochastic interest rates, Black-Scholes volatility models, and risk measures.     

A mixed integer programming model for multistage mean–variance post-tax optimization

In this paper, we introduce a mixed integer stochastic programming approach to mean–variance post-tax portfolio management. This approach takes into account of risk in a multistage setting and allows general withdrawals from original capital. The uncertainty on asset returns is specified as a scenario tree. The risk across scenarios is addressed using the probabilistic approach of classical stochastic programming. The tax rules are used with stochastic linear and mixed integer quadratic programming models to compute an overall tax and return-risk efficient multistage portfolio. The incorporation of the risk term in the model provides robustness and leads to diversification over wrappers and assets within each wrapper. General withdrawals and risk aversion have an impact on the distribution of assets among wrappers. Computational results are presented using a study with different scenario trees in order to show the performance of these models.     

A mixed integer linear programming model for optimal sovereign debt issuance

Governments borrow funds to finance the excess of cash payments or interest payments over receipts, usually by issuing fixed income debt and index-linked debt. The goal of this work is to propose a stochastic optimization-based approach to determine the composition of the portfolio issued over a series of government auctions for the fixed income debt, to minimize the cost of servicing debt while controlling risk and maintaining market liquidity. We show that this debt issuance problem can be modeled as a mixed integer linear programming problem with a receding horizon. The stochastic model for the interest rates is calibrated using a Kalman filter and the future interest rates are represented using a recombining trinomial lattice for the purpose of scenario-based optimization. The use of a latent factor interest rate model and a recombining lattice provides us with a realistic, yet very tractable scenario generator and allows us to do a multi-stage stochastic optimization involving integer variables on an ordinary desktop in a matter of seconds. This, in turn, facilitates frequent re-calibration of the interest rate model and re-optimization of the issuance throughout the budgetary year allows us to respond to the changes in the interest rate environment. We successfully demonstrate the utility of our approach by out-of-sample back-testing on the UK debt issuance data.     

A portfolio approach to managing procurement risk using multi-stage stochastic programming

Procurement is a critical supply chain management function that is susceptible to risk, due mainly to uncertain customer demand and purchase price volatility. A procurement approach in the form of a portfolio that incorporates the common procurement means is proposed. Such means include long-term contracts, spot procurements and option-based supply contracts. The objective is to explore possible synergies among the various procurement means, and so be able to produce optimal or near optimal results in profit while mitigating risk. The implementation of the portfolio approach is based on a multi-stage stochastic programming model in which replenishment decisions are made at various stages along a time horizon, with replenishment quantities being determined by simultaneously considering the stochastic demand and the price volatility of the spot market. The model attempts to minimise the risk exposure of procurement decisions measured as conditional value-at-risk. Numerical experiments to test the effectiveness of the proposed model are performed using demand data from a large air conditioner manufacturer in China and price volatility data from the Shanghai steel market. The results indicate that the proposed model can fairly reliably outperform other approaches, especially when either the demand and/or prices exhibit significant variability.     

Minimal-Variance Hedging in Large Financial Markets: Random Fields Approach

We study a large financial market where the discounted asset prices are modeled by martingale random fields. This approach allows the treatment of both the cases of a market with a countable amount of assets and of a market with a continuum amount. We discuss conditions for these markets to be complete and we study the minimal variance hedging problem both in the case of full and partial information. An explicit representation of the minimal variance hedging portfolio is suggested. Techniques of stochastic differentiation are applied to achieve the main results. Examples of large market models with a countable number of assets are considered according to the literature and an example of market model with a continuum of assets is taken from the bond market.     

The role of index bonds in universal currency hedging

This study examines the demand for index bonds and their role in hedging risky asset returns against currency risks in a complete market where equity is not hedged against inflation risk. Avellaneda's uncertain volatility model with non-constant coefficients to describe equity price variation, forward price variation, index bond price variation and rate of inflation, together with Merton's intertemporal portfolio choice model, are utilized to enable an investor to choose an optimal portfolio consisting of equity, nominal bonds and index bonds when the rate of inflation is uncertain. A hedge ratio is universal if investors in different countries hedge against currency risk to the same extent. Three universal hedge ratios (UHRs) are defined with respect to the investor's total demand for index bonds, hedging risky asset returns (i.e. equity and nominal bonds) against currency risk, which are not held for hedging purposes. These UHRs are hedge positions in foreign index bond portfolios, stated as a fraction of the national market portfolio. At equilibrium all the three UHRs are comparable to Black's corrected equilibrium hedging ratio. The Cameron-Martin-Girsanov theorem is applied to show that the Radon-Nikodym derivative given under a P -martingale, the investor's exchange rate (product of the two currencies) is a martingale. Therefore the investors can agree on a common hedging strategy to trade exchange rate risk irrespective of investor nationality. This makes the choice of the measurement currency irrelevant and the hedge ratio universal without affecting their values.     

Knowledge‐based scenario tree generation methods and application in multiperiod portfolio selection problem

A scenario tree is an efficient way to represent a stochastic data process in decision problems under uncertainty. This paper addresses how to efficiently generate appropriate scenario trees. A knowledge‐based scenario tree generation method is proposed; the new method is further improved by accounting for subjective judgements or expectations about the random future. Compared with existing approaches, complicated mathematical models and time‐consuming estimation, simulation and optimization problem solution are avoided in our knowledge‐based algorithms, and large‐scale scenario trees can be quickly generated. To show the advantages of the new algorithms, a multiperiod portfolio selection problem is considered, and a dynamic risk measure is adopted to control the intermediate risk, which is superior to the single‐period risk measure used in the existing literature. A series of numerical experiments are carried out by using real trading data from the Shanghai stock market. The results show that the scenarios generated by our algorithms can properly represent the underlying distribution; our algorithms have high performance, say, a scenario tree with up to 10,000 scenarios can be generated in less than a half minute. The applications in the multiperiod portfolio management problem demonstrate that our scenario tree generation methods are stable, and the optimal trading strategies obtained with the generated scenario tree are reasonable, efficient and robust. Copyright © 2013 John Wiley & Sons, Ltd.     

Scenario tree generation approaches using K-means and LP moment matching methods

We consider in this paper the efficient ways to generate multi-stage scenario trees. A general modified K-means clustering method is first presented to generate the scenario tree with a general structure. This method takes the time dependency of the simulated path into account. Based on the traditional and modified K-means analyses, the moment matching of multi-stage scenario trees is described as a linear programming (LP) problem. By simultaneously utilizing simulation, clustering, non-linear time series and moment matching skills, a sequential generation method and another new hybrid approach which can generate the whole multi-stage tree right off are proposed. The advantages of these new methods are: the vector autoregressive and multivariate generalized autoregressive conditional heteroscedasticity (VAR-MGARCH) model is adopted to properly reflect the inter-stage dependency and the time-varying volatilities of the data process, the LP-based moment matching technique ensures that the scenario tree generation problem can be solved more efficiently and the tree scale can be further controlled, and in the meanwhile, the statistical properties of the random data process are maintained properly. What is more important, our new LP methods can guarantee at least two branches are derived from each non-leaf node and thus overcome the drawback in relevant papers. We carry out a series of numerical experiments and apply the scenario tree generation methods to a portfolio management problem, which demonstrate the practicality, efficiency and advantages of our new approaches over other models or methods.     

Robust optimization models for managing callable bond portfolios

A major sector of the bond markets is currently represented by instruments with embedded call options. The complexity of bonds with call features, coupled with the recent increase in volatility, has raised the risks as well as the potential rewards for bond holders. These complexities, however, make it difficult for the portfolio manager to evaluate individual securities and their associated risks in order to successfully construct bond portfolios. Traditional bond portfolio management methods are inadequate, particularly when interest-rate-dependent cashflows are involved. In this paper we integrate traditional simulation models for bond pricing with recent developments in robust optimization to develop tools for the management of portfolios of callable bonds. Two models are developed: a single-period model that imposes robustness by penalizing downside tracking error, and a multi-stage stochastic program with recourse. Both models are applied to create a portfolio to track a callable bond index. The models are backtested using ex poste market data over the period from January 1992 to March 1993, and they perform constistently well.