Robust optimisation and its application to portfolio planning

This thesis was submitted for the degree of Doctor of Philosophy and awarded by Brunel University.Decision making under uncertainty presents major challenges from both modelling and solution methods perspectives. The need for stochastic optimisation methods is widely recognised; however, compromises typically have to be made in order to develop computationally tractable models. Robust optimisation is a practical alternative to stochastic optimisation approaches, particularly suited for problems in which parameter values are unknown and variable. In this thesis, we review robust optimisation, in which parameter uncertainty is defined by budgeted polyhedral uncertainty sets as opposed to ellipsoidal sets, and consider its application to portfolio selection. The modelling of parameter uncertainty within a robust optimisation framework, in terms of structure and scale, and the use of uncertainty sets is examined in detail. We investigate the effect of different definitions of the bounds on the uncertainty sets. An interpretation of the robust counterpart from a min-max perspective, as applied to portfolio selection, is given. We propose an extension of the robust portfolio selection model, which includes a buy-in threshold and an upper limit on cardinality. We investigate the application of robust optimisation to portfolio selection through an extensive empirical investigation of cost, robustness and performance with respect to risk-adjusted return measures and worst case portfolio returns. We present new insights into modelling uncertainty and the properties of robust optimal decisions and model parameters. Our experimental results, in the application of portfolio selection, show that robust solutions come at a cost, but in exchange for a guaranteed probability of optimality on the objective function value, significantly greater achieved robustness, and generally better realisations under worst case scenarios

Robust optimisation and its application to portfolio planning

Decision making under uncertainty presents major challenges from both modelling and solution methods perspectives. The need for stochastic optimisation methods is widely recognised; however, compromises typically have to be made in order to develop computationally tractable models. Robust optimisation is a practical alternative to stochastic optimisation approaches, particularly suited for problems in which parameter values are unknown and variable. In this thesis, we review robust optimisation, in which parameter uncertainty is defined by budgeted polyhedral uncertainty sets as opposed to ellipsoidal sets, and consider its application to portfolio selection. The modelling of parameter uncertainty within a robust optimisation framework, in terms of structure and scale, and the use of uncertainty sets is examined in detail. We investigate the effect of different definitions of the bounds on the uncertainty sets. An interpretation of the robust counterpart from a min-max perspective, as applied to portfolio selection, is given. We propose an extension of the robust portfolio selection model, which includes a buy-in threshold and an upper limit on cardinality. We investigate the application of robust optimisation to portfolio selection through an extensive empirical investigation of cost, robustness and performance with respect to risk-adjusted return measures and worst case portfolio returns. We present new insights into modelling uncertainty and the properties of robust optimal decisions and model parameters. Our experimental results, in the application of portfolio selection, show that robust solutions come at a cost, but in exchange for a guaranteed probability of optimality on the objective function value, significantly greater achieved robustness, and generally better realisations under worst case scenarios.EThOS - Electronic Theses Online ServiceGBUnited Kingdo

Using Semialgebraic Parametric Analysis by Metaprogramming in Portfolio Optimization

One classic problem in quantitative finance is portfolio optimization, which consists of assigning weights to assets in a portfolio to maximize one’s expected return while keeping the level of risk at a desired level. This problem can be modeled as a linear program (LP), using a risk aversion parameter mu. For a given single value of mu, the LP can be solved using any standard LP solver. In this work, however, the problem is considered parametrically: the optimal solution is sought for every possible value of mu. This describes how weights to the portfolio assets would be assigned from the timid investor to the bold. This is accomplished by applying the novel technique of semi-algebraic parametric analysis by metaprogramming (SPAM). Demonstrated in this talk is the method of applying SPAM to a textbook example of portfolio optimization. Generated in this way are numerical and symbolic representations of the solution set as well as a graphical representation of these results

Energy only, capacity market and security of supply. A stochastic equilibrium analysis

Former generation capacity expansion models were formulated as optimization problems. These included a reliability criterion and hence guaranteed security of supply. The situation is different in restructured markets where investments need to be incentivised by the margin resulting from electricity sales after accounting for fuel costs. The situation is further complicated by the payments and charges on the carbon market. We formulate an equilibrium model of the electricity sector with both investments and operations. Electricity prices are set at the fuel cost of the last operating unit when there is no curtailment, and at some regulated price cap when there is curtailment. There is a CO2 market and different policies for allocating allowances. Todays situation is quite risky for investors. Fuel prices are more volatile than ever; the total amount of CO2 allowances and the allocation method will only be known after investments has been decided. The equilibrium model is thus one under uncertainty. Agents can be risk neutral or risk averse. We model risk aversion through a CVaR of the net margin of the industry. The CVaR induces a risk neutral probability according to which investors value their plants. The model is formulated as a complementarity problem (including the CVaR valuation of investment). An illustration is provided on a small problem that captures the essence of today electricity world: a choice restricted to coal and gas, a peaky load curve because of wind penetration, uncertain fuel prices and an evolving carbon market (EU-ETS). We show that we might have problem of security of supply if we do not implement a capacity market.capacity adequacy, risk functions, stochastic equilibrium models

Robust reconnaissance asset planning under uncertainty

Thesis (S.M.)--Massachusetts Institute of Technology, Sloan School of Management, Operations Research Center, 2013.This electronic version was submitted by the student author. The certified thesis is available in the Institute Archives and Special Collections.Cataloged from student-submitted PDF version of thesis.Includes bibliographical references (pages 105-107).This thesis considers the tactical reconnaissance asset allocation problem in military operations. Specifically this thesis presents methods to optimize, under uncertain conditions, tactical reconnaissance asset allocation in order to maximize, within acceptable levels of asset risk exposure, the expected total information collection value. We propose a deterministic integer optimization formulation and two robust mixed-integer optimization extensions to address this problem. Robustness is applied to our model using both polyhedral and ellipsoidal uncertainty sets resulting in tractable mixed integer linear and second order cone problems. We show through experimentation that robust optimization leads to overall improvements in solution quality compared to non-robust and typical human generated plans. Additionally we show that by using our robust models, military planners can ensure better solution feasibility compared to non-robust planning methods even if they seriously misjudge their knowledge of the enemy and the battlefield. We also compare the trade-offs of using polyhedral and ellipsoidal uncertainty sets. In our tests our model using ellipsoidal uncertainty sets provided better quality solutions at a cost of longer average solution times to that of the polyhedral uncertainty set model. Lastly we outline a special case of our models that allows us to improve solution time at the cost of some solution quality.by David M. Culver.S.M

Linearly Parameterized Bandits

We consider bandit problems involving a large (possibly infinite) collection of arms, in which the expected reward of each arm is a linear function of an $r$-dimensional random vector $\mathbf{Z} \in \mathbb{R}^r$, where $r \geq 2$. The objective is to minimize the cumulative regret and Bayes risk. When the set of arms corresponds to the unit sphere, we prove that the regret and Bayes risk is of order $\Theta(r \sqrt{T})$, by establishing a lower bound for an arbitrary policy, and showing that a matching upper bound is obtained through a policy that alternates between exploration and exploitation phases. The phase-based policy is also shown to be effective if the set of arms satisfies a strong convexity condition. For the case of a general set of arms, we describe a near-optimal policy whose regret and Bayes risk admit upper bounds of the form $O(r \sqrt{T} \log^{3/2} T)$.Comment: 40 pages; updated results and reference

Distributionally Robust Optimization: A Review

The concepts of risk-aversion, chance-constrained optimization, and robust optimization have developed significantly over the last decade. Statistical learning community has also witnessed a rapid theoretical and applied growth by relying on these concepts. A modeling framework, called distributionally robust optimization (DRO), has recently received significant attention in both the operations research and statistical learning communities. This paper surveys main concepts and contributions to DRO, and its relationships with robust optimization, risk-aversion, chance-constrained optimization, and function regularization