A vállalati likviditáskezelés szerepe eszközfedezettel rendelkező hitelszerződésekben. Az alkun alapuló megközelítés eredményei (The role of corporate liquidity management under secured debt financing Results of the bargaining approach)

A szerző azt a kérdést vizsgálja, hogy a vállalat működése során a likvid eszközök mekkora arányát tartsa fenn. A kérdést a finanszírozás szemszögéből veti fel, mivel a hitelezés okozta korlátok jelentősen befolyásolják a likvid eszköz tartalékolásának motivációit. A cikk a vállalkozói-hitelezői információs kapcsolat háromféle esetében mutatja be az eszközfedezettel rendelkező hitelek adósságszolgálatát meghatározó tényezőket. Elsőként a teljes információs viszony melletti stratégiákkal meghatározott adósságszolgálatot vizsgálja, majd a második típusú információs kapcsolatban a nem megfigyelhető vállalkozói erőfeszítéseket feltételezve adja meg az adósságszolgálat fizetésének ex ante és ex post egyensúlyát. Harmadikként, a nem igazolható vállalati adatok feltevése mellett teljes és részleges eszközfedezetre is meghatározza az optimális vállalkozói likviditási politikát, és tárgyalja az itt fennálló ellentéteket. Megmutatja, hogy részleges eszközfedezet mellett 1. újratárgyalható a hitelszerződés, és a stratégiai adósságszolgálatot nem lehet elkerülni, 2. a likviditásoptimalizálásnak nincs ex post Pareto-egyensúlyi megoldása, ugyanis a hitelszerződésben részt vevő felek alkuereje határozza meg a vállalat likviditásának szintjét. / === / This paper investigates what the liquid asset ratio for firms should be. Financing constraints significantly influence motivations for liquidity hoarding. The article shows the determinants of secured debt services for three different information cases of a lender-borrower relationship. First, it examines the strategic debt service under full information, and then, assuming non-observable entrepreneurial efforts, it gives the ex ante and ex post equilibria of the strategic debt service. The third case supposes non-verifiable firm information; this provides the optimal corporate liquidity policy and explains the contrary propositions. It shows that under not fully secured collateral, 1. the debt contract is renegotiable; the lender cannot avoid the strategic debt service, 2. there is no ex post optimal Pareto efficient solution to liquidity policy, because the corporate liquidity ratio is determined by the bargaining power of the partners in the debt contract.

Improved stochastic optimization of railway timetables

We present a general model to find the best allocation of a limited amount of supplements (extra minutes added to a timetable in order to reduce delays) on a set of interfering railway lines. By the best allocation, we mean the solution under which the weighted sum of expected delays is minimal. Our aim is to finely adjust an already existing and well-functioning timetable. We model this inherently stochastic optimization problem by using two-stage recourse models from stochastic programming, building upon earlier research from the literature. We present an improved formulation, allowing for an efficient solution using a standard algorithm for recourse models. We show that our model may be solved using any of the following theoretical frameworks: linear programming, stochastic programming and convex non-linear programming, and present a comparison of these approaches based on a real-life case study. Finally, we introduce stochastic dependency into the model, and present a statistical technique to estimate the model parameters from empirical data.

Teaching Sorting in ICT

This article is aimed at considering how an algorithmic problem - more precisely a sorting problem - can be used in an informatics class in primary and secondary education to make students mobilize the largest possible amount of their intellectual skills in the problem solving process. We will be outlining a method which essentially forces students to utilize their mathematical knowledge besides algorithmization in order to provide an efficient solution. What is more, they are expected to use efficiently a tool that has so far not been associated with creative thinking. Sorting is meant to be just an example, through which our thoughts can easily be demonstrated, but - of course the method of education outlined can be linked to several other algorithmic problems, as well.

Solution of the Least Squares Method problem of pairwise comparison matrices

The aim of the paper is to present a new global optimization method for determining all the optima of the Least Squares Method (LSM) problem of pairwise comparison matrices. Such matrices are used, e.g., in the Analytic Hierarchy Process (AHP). Unlike some other distance minimizing methods, LSM is usually hard to solve because of the corresponding nonlinear and non-convex objective function. It is found that the optimization problem can be reduced to solve a system of polynomial equations. Homotopy method is applied which is an efficient technique for solving nonlinear systems. The paper ends by two numerical example having multiple global and local minima.