Working paper
Optimal transportation of processes with infinite Kantorovich distance. Independence and symmetry.
We study the Monge--Kantorovich problem with one-dimensional marginals $\mu$ and $\nu$ and
the cost function $c = \min\{l_1, \ldots, l_n\}$
that equals the minimum of a finite number $n$ of affine functions $l_i$
satisfying certain non-degeneracy assumptions. We prove that the problem
is equivalent to a finite-dimensional extremal problem. More precisely, it is shown that the solution is concentrated
on the union of $n$ products $I_i \times J_i$, where $\{I_i\}$ and $\{J_i\}$
are partitions of the real line into unions of disjoint connected sets.
The families of sets $\{I_i\}$ and $\{J_i\}$ have the following properties: 1) $c=l_i$ on $I_i \times J_i$,
2) $\{I_i\}, \{J_i\}$ is a couple of partitions solving an auxiliary $n$-dimensional extremal problem.
The result is partially generalized to the case of more than two marginals.
The paper discusses a new approach to developing tools for quantitatively analyzing the financial behavior of small and medium price-taking traders each possessing abilities to predict share price values for a set of financial securities traded in a stock exchange. Tools for forming and managing a trader’s portfolio of securities from this set are proposed. Particularly, it is shown that when the trader can treat share price values from the portfolio as random variables with known (to her) distributions, an optimal portfolio composition is found by solving a linear programming problem. Otherwise, this optimal composition is found as the trader’s equilibrium strategy in an antagonistic two-person game with the stock exchange being the other player. In this game on polyhedra of disjoint player strategies, described by systems of linear equations and inequalities of a balance kind, calculating saddle points is reduced to solving linear programming problems forming a dual pair.
This article gives a survey of recent research related to the Monge-Kantorovich problem. Principle results are presented on the existence of solutions and their properties both in the Monge optimal transportation problem and the Kantorovich optimal plan problem, along with results on the connections between both problems and the cases when they are equivalent. Diverse applications of these problems in non-linear analysis, probability theory, and differential geometry are discussed.
We consider finite Markov decision processes (MDPs) with undiscounted total effective payoff. We show that there exist uniformly optimal pure stationary strategies that can be computed by solving a polynomial number of linear programs. We apply this result to two-player zero-sum stochastic games with perfect information and undiscounted total effective payoff, and derive the existence of a saddle point in uniformly optimal pure stationary strategies.
The issue of using the MathCAD software package in a university educational course for learning to solve optimization problems is considered. The advantage of working with this program is shown and its main features are discussed in the appendix to this course.
Contents of the book is divided into 2 parts of deterministic and stochastic models of Operations Research.
The first part of "Deterministic models of Operations Research" - is the base section, in which the emphasis is on linear programming.
The second part - "Stochastic models of Operations Research" includes a model of reliability and queuing models. This is original material.
The textbook can be useful to students of undergraduate and graduate programs in areas of training in "Applied Mathematics", "Applied Mathematics and Computer Science", "Information systems and technologies", as well as graduate students and science teachers who are interested in the problems of optimization in stochastic models
We consider probability measures on R∞ and study optimal transportation mappings for the case of infinite Kantorovich distance. Our examples include 1) quasi-product measures, 2) measures with certain symmetric properties, in particular, exchangeable and stationary measures. We show in the latter case that existence problem for optimal transportation is closely related to ergodicity of the target measure. In particular, we prove existence of the symmetric optimal transportation for a certain class of stationary Gibbs measures.
The manual is devoted to the mathematical theory and methods of optimization applied to administrative decisions in economy. Volume 1 described approaches to mathematical modeling of management problems in economy and methods of mathematical programming tasks solution. Besides strict mathematical proofs, there are directing reasons, which is sometimes enough for understanding. There are many economic examples and exercises with detailed solutions. Readers are supposed to know the bases of the mathematical analysis and linear algebra, though necessary data from these courses in a concise form are provided in appendices.
A model for organizing cargo transportation between two node stations connected by a railway line which contains a certain number of intermediate stations is considered. The movement of cargo is in one direction. Such a situation may occur, for example, if one of the node stations is located in a region which produce raw material for manufacturing industry located in another region, and there is another node station. The organization of freight traffic is performed by means of a number of technologies. These technologies determine the rules for taking on cargo at the initial node station, the rules of interaction between neighboring stations, as well as the rule of distribution of cargo to the final node stations. The process of cargo transportation is followed by the set rule of control. For such a model, one must determine possible modes of cargo transportation and describe their properties. This model is described by a finite-dimensional system of differential equations with nonlocal linear restrictions. The class of the solution satisfying nonlocal linear restrictions is extremely narrow. It results in the need for the “correct” extension of solutions of a system of differential equations to a class of quasi-solutions having the distinctive feature of gaps in a countable number of points. It was possible numerically using the Runge–Kutta method of the fourth order to build these quasi-solutions and determine their rate of growth. Let us note that in the technical plan the main complexity consisted in obtaining quasi-solutions satisfying the nonlocal linear restrictions. Furthermore, we investigated the dependence of quasi-solutions and, in particular, sizes of gaps (jumps) of solutions on a number of parameters of the model characterizing a rule of control, technologies for transportation of cargo and intensity of giving of cargo on a node station.
This proceedings publication is a compilation of selected contributions from the “Third International Conference on the Dynamics of Information Systems” which took place at the University of Florida, Gainesville, February 16–18, 2011. The purpose of this conference was to bring together scientists and engineers from industry, government, and academia in order to exchange new discoveries and results in a broad range of topics relevant to the theory and practice of dynamics of information systems. Dynamics of Information Systems: Mathematical Foundation presents state-of-the art research and is intended for graduate students and researchers interested in some of the most recent discoveries in information theory and dynamical systems. Scientists in other disciplines may also benefit from the applications of new developments to their own area of study.