Reducing the dynamic model of the software development market to a block problem of convex programming

 
PIIS042473880024879-5-1
DOI10.31857/S042473880024879-5
Publication type Article
Status Published
Authors
Occupation: Senior Engineer
Affiliation: Joint-Stock Company «Scientific and Production Association Russian basic information technology
Address: Moscow, Russian Federation
Occupation: Senior Research Scholar
Affiliation: Joint-Stock Company «Scientific and Production Association Russian basic information technology
Address: Russian Federation
Journal nameEkonomika i matematicheskie metody
EditionVolume 59 No. 1
Pages119-130
Abstract

The authors propose to reduce a discrete dynamic model of the software development market to a block problem of convex programming, which can be solved by successive approximations based on contraction mapping, in case of abandoning the integer elements of the destination matrix. However, there are also peculiarities: equilibrium prices can be calculated directly and therefore a variational formulation of the internal problem of determining equilibrium prices based on Debreu's theorem is not required. The functions of phase coordinates’ change can be taken as convex, for example, the norm of the difference squared, and do not take into account the fixed costs for each control switch, which is excluded from the equations of system’s dynamics. The resulting block problem of convex programming allows decomposition by freezing the connection variables with neighboring blocks at the level of the previous iteration. It is shown that the operator on the right side of the resulting recurrent equation is compressive under fairly general conditions. This allows the authors to prove successive approximations for solving the resulting problem, based on the principle of contraction mapping. The authors give the model example of its use in the dynamic expansion of the transport problem according to the value.

Keywordstransport problem according to the value, problem’s dynamic expansion, exclusion of controls, problem’s decomposition, the principle of contraction mapping, the method of successive approximations
Received16.03.2023
Publication date29.03.2023
Number of characters24937
Cite  
100 rub.
When subscribing to an article or issue, the user can download PDF, evaluate the publication or contact the author. Need to register.

Number of purchasers: 0, views: 193

Readers community rating: votes 0

1. Ashmanov S.A. (1981). Linear programming. Moscow: Nauka (in Russian).

2. Debreu G. (1954). Valuation equilibrium and Pareto optimum. Proceedings of the National Academy of Sciences of the USA, 40, 588–592.

3. Ding X., Wang K., Gibbons P.B., Zhang X. (2012). BWS: balanced work stealing for time-sharing multicores. Proceedings of the 7th ACM European Conference on Computer Systems. EuroSys, 12. New York, 365–378.

4. Korbut A.A., Finkilstein Yu.Yu. (1969): Discrete programming D.B. Yudin (ed.). Moscow: Nauka (in Russian).

5. Lesik I.A., Perevozchikov A.G. (2016). Determination of optimal production volumes and sales prices in a linear model of a multi-product monopoly. Economics and Mathematical Methods, 52, 1, 140–148 (in Russian).

6. Lesik I.A., Perevozchikov A.G. (2020). A dynamic model of investment in scientific research of an oligopoly. Economics and Mathematical Methods, 56, 2, 102–114 (in Russian).

7. Lesik I.A., Perevozchikov A.G. (2021). A dynamic model of software development based on the problem of assignment to bottlenecks. Economics and Mathematical Methods, 56, 4, 102–114 (in Russian).

8. Lesik I.A., Perevozchikov A.G. (2022): Market’s static model for software development based on a transport problem with quadratic cost additions. Economics and Mathematical Methods, 58, 3, 94–101 (in Russian).

9. Makarov V.L., Rubinov F.M. (1973). Mathematical theory of economic dynamics and equilibrium. Moscow: Nauka (in Russian).

10. Mesoeconomics of development (2011). G.B. Kleiner (ed.). Moscow: Nauka (in Russian).

11. Perevozchikov A.G., Lesik I.A. (2014). Non-stationary model of investment in fixed assets of the enterprise. In: Applied mathematics and computer science: Proceedings of the Faculty of Computational mathematics and cybernetics of Lomonosov Moscow State University. V.I. Dmitriev (ed.). Moscow: MAKS Press, 46, 76–88 (in Russian).

12. Polyak B.T. (1983). Introduction to optimization. Moscow: Nauka (in Russian).

13. Sergienko A.M., Simonenko V.P., Simonenko A.V. (2016). Improved assignment algorithm for task schedulers in heterogeneous distributed computing systems. System Research and Information Technologies, 2, 20–35 (in Russian).

14. Tsurkov V.I. (1981). Decomposition in large-dimensional problems. Moscow: Nauka (in Russian).

15. Ustyuzhanina E.V., Dement’ev V.E., Evsyukov S.G. (2021). Transactional digital platforms: the task of ensuring efficiency. Economics and Mathematical Methods, 57, 1, 5–18 (in Russian).

16. Vasil’ev F.P. (1981). Methods for solving extreme problems. Moscow: Nauka (in Russian).

17. Vasin A.A., Grigor’eva O.M., Cyganov N.I. (2017). Optimization of the transport system of the energy market. Reports of the Academy of Sciences, 475, 4, 377–381 (in Russian).

18. Vasin A.A., Grigor’eva O.M., Lesik I.A. (2017). Synthesis of the transport system of a multi-node competitive market with variable demand. Applied Mathematics and computer science: Proceedings of the Faculty of Computational mathematics and cybernatics of Lomonosov Moscow State University. V.I. Dmitriev (ed.). Moscow: MAKS Press, 55, 74–90 (in Russian).

19. Vasin A.A., Grigor’eva O.M., Lesik I.A. (2018). The problem of optimizing the transport system of the energy market. In: The collection of the IX Moscow International Conference on Operations Research (ORM2018). Proceedings. A.A. Vasin, A.F. Izmailov (resp. eds.), 247–251 (in Russian).

20. Vasin A.A., Morozov V.V. (2005). Game theory and models of mathematical economics. Moscow: MAKS Press (in Russian).

Система Orphus

Loading...
Up