Linear Programming Models based on Omega Ratio for the Enhanced Index Tracking Problem

Modern performance measures differ from the classical ones since they assess the performance against a benchmark and usually account for asymmetry in return distributions. The Omega ratio is one of these measures. Until recently, limited research has addressed the optimization of the Omega ratio since it has been thought to be computationally intractable. The Enhanced Index Tracking Problem (EITP) is the problem of selecting a portfolio of securities able to outperform a market index while bearing a limited additional risk. In this paper, we propose two novel mathematical formulations for the EITP based on the Omega ratio. The first formulation applies a standard definition of the Omega ratio where it is computed with respect to a given value, whereas the second formulation considers the Omega ratio with respect to a random target. We show how each formulation, nonlinear in nature, can be transformed into a Linear Programming model. We further extend the models to include real features, such as a cardinality constraint and buy-in thresholds on the investments, obtaining Mixed Integer Linear Programming problems. Computational results conducted on a large set of benchmark instances show that the portfolios selected by the model assuming a standard definition of the Omega ratio are consistently outperformed, in terms of out-of-sample performance, by those obtained solving the model that considers a random target. Furthermore, in most of the instances the portfolios optimized with the latter model mimic very closely the behavior of the benchmark over the out-of-sample period, while yielding, sometimes, significantly larger returns

Enhanced index tracking with CVaR-based ratio measures

n/

New approximate stochastic dominance approaches for Enhanced Indexation models

In this paper, we discuss portfolio selection strategies for Enhanced Indexation (EI), which are based on stochastic dominance relations. The goal is to select portfolios that stochastically dominate a given benchmark but that, at the same time, must generate some excess return with respect to a benchmark index. To achieve this goal, we propose a new methodology that selects portfolios using the ordered weighted average (OWA) operator, which generalizes previous approaches based on minimax selection rules and still leads to solving linear programming models. We also introduce a new type of approximate stochastic dominance rule and show that it implies the almost Second-order Stochastic Dominance (SSD) criterion proposed by Lizyayev and Ruszczynski (2012). We prove that our EI model based on OWA selects portfolios that dominate a given benchmark through this new form of stochastic dominance criterion. We test the performance of the obtained portfolios in an extensive empirical analysis based on real-world datasets. The computational results show that our proposed approach outperforms several SSD-based strategies widely used in the literature, as well as the global minimum variance portfolio

A heuristic framework for the bi-objective enhanced index tracking problem

The index tracking problem is the problem of determining a portfolio of assets whose performance replicates, as closely as possible, that of a financial market index chosen as benchmark. In the enhanced index tracking problem the portfolio is expected to outperform the benchmark with minimal additional risk. In this paper, we study the bi-objective enhanced index tracking problem where two competing objectives, i.e., the expected excess return of the portfolio over the benchmark and the tracking error, are taken into consideration. A bi-objective Mixed Integer Linear Programming formulation for the problem is proposed. Computational results on a set of benchmark instances are given, along with a detailed out-of-sample analysis of the performance of the optimal portfolios selected by the proposed model. Then, a heuristic procedure is designed to build an approximation of the set of Pareto optimal solutions. We test the proposed procedure on a reference set of Pareto optimal solutions. Computational results show that the procedure is significantly faster than the exact computation and provides an extremely accurate approximation

Estimating fuel-efficient air plane trajectories using machine learning

Airline industry has witnessed a tremendous growth in the recent past. Percentage of people choosing air travel as first choice to commute is continuously increasing. Highly demanding and congested air routes are resulting in inadvertent delays, additional fuel consumption and high emission of greenhouse gases. Trajectory planning involves creation identification of cost-effective flight plans for optimal utilization of fuel and time. This situation warrants the need of an intelligent system for dynamic planning of optimized flight trajectories with least human intervention required. In this paper, an algorithm for dynamic planning of optimized flight trajectories has been proposed. The proposed algorithm divides the airspace into four dimensional cubes and calculate a dynamic score for each cube to cumulatively represent estimated weather, aerodynamic drag and air traffic within that virtual cube. There are several constraints like simultaneous flight separation rules, weather conditions like air temperature, pressure, humidity, wind speed and direction that pose a real challenge for calculating optimal flight trajectories. To validate the proposed methodology, a case analysis was undertaken within Indian airspace. The flight routes were simulated for four different air routes within Indian airspace. The experiment results observed a seven percent reduction in drag values on the predicted path, hence indicates reduction in carbon footprint and better fuel economy

Optimally chosen small portfolios are better than large ones

One of the fundamental principles in portfolio selection models is minimization of risk through diversification of the investment. However, this principle does not necessarily translate into a request for investing in all the assets of the investment universe. Indeed, following a line of research started by Evans and Archer almost fifty years ago, we provide here further evidence that small portfolios are sufficient to achieve almost optimal in-sample risk reduction with respect to variance and to some other popular risk measures, and very good out-of-sample performances. While leading to similar results, our approach is significantly different from the classical one pioneered by Evans and Archer. Indeed, we describe models for choosing the portfolio of a prescribed size with the smallest possible risk, as opposed to the random portfolio choice investigated in most of the previous works. We find that the smallest risk portfolios generally require no more than 15 assets. Furthermore, it is almost always possible to find portfolios that are just 1% more risky than the smallest risk portfolios and contain no more than 10 assets. Furthermore, the optimal small portfolios generally show a better performance than the optimal large ones. Our empirical analysis is based on some new and on some publicly available benchmark data sets often used in the literature

Relationships between the stochastic discount factor and the optimal omega ratio

The omega ratio is an interesting performance measure because it fo- cuses on both downside losses and upside gains, and nancial markets are re ecting more and more asymmetry and heavy tails. This paper focuses on the omega ratio optimization in general Banach spaces, which applies for both in nite dimensional approaches related to continuous time stochastic pricing models (Black and Scholes, stochastic volatility, etc.) and more classical problems in portfolio selection. New algorithms will be provided, as well as Fritz John-like and Karush-Kuhn-Tucker-like optimality conditions and duality results, despite the fact that omega is neither di¤er- entiable nor convex. The optimality conditions will be applied to the most important pricing models of Financial Mathematics, and it will be shown that the optimal value of omega only depends on the upper and lower bounds of the pricing model stochastic discount factor. In particular, if the stochastic discount factor is unbounded (Black and Scholes, Heston, etc.) then the optimal omega ratio becomes unbounded too (it may tend to in nity), and the introduction of several nancial constraints does not overcome this caveat. The new algorithms and optimality conditions will also apply to optimize omega in static frameworks, and it will be illustrated that both in nite- and nite-dimensional approaches may be useful to this purpose

Models and Matheuristics for Large-Scale Combinatorial Optimization Problems

Combinatorial optimization deals with efficiently determining an optimal (or at least a good) decision among a finite set of alternatives. In business administration, such combinatorial optimization problems arise in, e.g., portfolio selection, project management, data analysis, and logistics. These optimization problems have in common that the set of alternatives becomes very large as the problem size increases, and therefore an exhaustive search of all alternatives may require a prohibitively long computation time. Moreover, due to their combinatorial nature no closed-form solutions to these problems exist. In practice, a common approach to tackle combinatorial optimization problems is to formulate them as mathematical models and to solve them using a mathematical programming solver (cf., e.g., Bixby et al. 1999, Achterberg et al. 2020). For small-scale problem instances, the mathematical models comprise a manageable number of variables and constraints such that mathematical programming solvers are able to devise optimal solutions within a reasonable computation time. For large-scale problem instances, the number of variables and constraints becomes very large which extends the computation time required to find an optimal solution considerably. Therefore, despite the continuously improving performance of mathematical programming solvers and computing hardware, the availability of mathematical models that are efficient in terms of the number of variables and constraints used is of crucial importance. Another frequently used approach to address combinatorial optimization problems are matheuristics. Matheuristics decompose the considered optimization problem into subproblems, which are then formulated as mathematical models and solved with the help of a mathematical programming solver. Matheuristics are particularly suitable for situations where it is required to find a good, but not necessarily an optimal solution within a short computation time, since the speed of the solution process can be controlled by choosing an appropriate size of the subproblems. This thesis consists of three papers on large-scale combinatorial optimization problems. We consider a portfolio optimization problem in finance, a scheduling problem in project management, and a clustering problem in data analysis. For these problems, we present novel mathematical models that require a relatively small number of variables and constraints, and we develop matheuristics that are based on novel problem-decomposition strategies. In extensive computational experiments, the proposed models and matheuristics performed favorably compared to state-of-the-art models and solution approaches from the literature. In the first paper, we consider the problem of determining a portfolio for an enhanced index-tracking fund. Enhanced index-tracking funds aim to replicate the returns of a particular financial stock-market index as closely as possible while outperforming that index by a small positive excess return. Additionally, we consider various real-life constraints that may be imposed by investors, stock exchanges, or investment guidelines. Since enhanced index-tracking funds are particularly attractive to investors if the index comprises a large number of stocks and thus is well diversified, it is of particular interest to tackle large-scale problem instances. For this problem, we present two matheuristics that consist of a novel construction matheuristic, and two different improvement matheuristics that are based on the concepts of local branching (cf. Fischetti and Lodi 2003) and iterated greedy heuristics (cf., e.g., Ruiz and Stützle 2007). Moreover, both matheuristics are based on a novel mathematical model for which we provide insights that allow to remove numerous redundant variables and constraints. We tested both matheuristics in a computational experiment on problem instances that are based on large stock-market indices with up to 9,427 constituents. It turns out that our matheuristics yield better portfolios than benchmark approaches in terms of out-of-sample risk-return characteristics. In the second paper, we consider the problem of scheduling a set of precedence-related project activities, each of which requiring some time and scarce resources during their execution. For each activity, alternative execution modes are given, which differ in the duration and the resource requirements of the activity. Sought is a start time and an execution mode for each activity, such that all precedence relationships are respected, the required amount of each resource does not exceed its prescribed capacity, and the project makespan is minimized. For this problem, we present two novel mathematical models, in which the number of variables remains constant when the range of the activities' durations and thus also the planning horizon is increased. Moreover, we enhance the performance of the proposed mathematical models by eliminating some symmetric solutions from the search space and by adding some redundant sequencing constraints for activities that cannot be processed in parallel. In a computational experiment based on instances consisting of activities with durations ranging from one up to 260 time units, the proposed models consistently outperformed all reference models from the literature. In the third paper, we consider the problem of grouping similar objects into clusters, where the similarity between a pair of objects is determined by a distance measure based on some features of the objects. In addition, we consider constraints that impose a maximum capacity for the clusters, since the size of the clusters is often restricted in practical clustering applications. Furthermore, practical clustering applications are often characterized by a very large number of objects to be clustered. For this reason, we present a matheuristic based on novel problem-decomposition strategies that are specifically designed for large-scale problem instances. The proposed matheuristic comprises two phases. In the first phase, we decompose the considered problem into a series of generalized assignment problems, and in the second phase, we decompose the problem into subproblems that comprise groups of clusters only. In a computational experiment, we tested the proposed matheuristic on problem instances with up to 498,378 objects. The proposed matheuristic consistently outperformed the state-of-the-art approach on medium- and large-scale instances, while matching the performance for small-scale instances. Although we considered three specific optimization problems in this thesis, the proposed models and matheuristics can be adapted to related optimization problems with only minor modifications. Examples for such related optimization problems are the UCITS-constrained index-tracking problem (cf, e.g., Strub and Trautmann 2019), which consists of determining the portfolio of an investment fund that must comply with regulatory restrictions imposed by the European Union, the multi-site resource-constrained project scheduling problem (cf., e.g., Laurent et al. 2017), which comprises the scheduling of a set of project activities that can be executed at alternative sites, or constrained clustering problems with must-link and cannot-link constraints (cf., e.g., González-Almagro et al. 2020)