Boundedness of the value function of the worst-case portfolio selection problem with linear constraints
We present a robust dynamic programming approach to the general portfolio selection problem in the presence of transaction costs and trading limits. We formulate the problem as a dynamic infinite game against nature and obtain the corresponding Bellman-Isaacs equation. Under~several additional assumptions, we get an alternative form of the equation, which is more feasible for a numerical solution. The framework covers a wide range of control problems, such as the estimation of the portfolio liquidation value, or portfolio selection in an adverse market. The~results can be used in the presence of model errors, non-linear transaction costs and a price impact.
Motivated by applications in manufacturing industry, we consider a supply chain scheduling problem, where each job is characterised by non-identical sizes, different release times and unequal processing times. The objective is to minimise the makespan by making batching and sequencing decisions. The problem is formalised as a mixed integer programming model and proved to be strongly NP-hard. Some structural properties are presented for both the general case and a special case. Based on these properties, a lower bound is derived, and a novel two-phase heuristic (TP-H) is developed to solve the problem, which guarantees to obtain a worst case performance ratio of . Computational experiments with a set of different sizes of random instances are conducted to evaluate the proposed approach TP-H, which is superior to another two heuristics proposed in the literature. Furthermore, the experimental results indicate that TP-H can effectively and efficiently solve large-size problems in a reasonable time.
The problem of optimal portfolio liquidation under transaction costs has been widely researched recently, thus producing several approaches to problem formulation and solving. Obtained results can be used for decision making during portfolio selection or automatic trading at high-frequency electronic markets. This work gives a review of modern studies in this field, comparing models and tracking their evolution. The paper also presents results of applying the most recent findings in this field to real MICEX shares high-frequency data and gives an interpretation of the results.
This paper proposes a procedure for dynamic optimization of an investment portfolio, consisting of stock market indices. SJC-copulas were used to assets statistical characteristics of assets. Copulas allow to measure interdependence between financial instruments, and to build an efficient investment portfolio. Since statistical characteristics of assets are changing with time, the structure of the portfolio is upgrading accordingly. The portfolio is then compared with two benchmarks in terms of return and risk. As a result the proposed procedure provides better performance. Also, the paper studies building a portfolio with short positions
We consider certain spaces of functions on the circle, which naturally appear in harmonic analysis, and superposition operators on these spaces. We study the following question: which functions have the property that each their superposition with a homeomorphism of the circle belongs to a given space? We also study the multidimensional case.
We consider the spaces of functions on the m-dimensional torus, whose Fourier transform is p -summable. We obtain estimates for the norms of the exponential functions deformed by a C1 -smooth phase. The results generalize to the multidimensional case the one-dimensional results obtained by the author earlier in “Quantitative estimates in the Beurling—Helson theorem”, Sbornik: Mathematics, 201:12 (2010), 1811 – 1836.
We consider the spaces of function on the circle whose Fourier transform is p-summable. We obtain estimates for the norms of exponential functions deformed by a C1 -smooth phase.