Izvestiya of Saratov University.

Economics. Management. Law

ISSN 1994-2540 (Print)
ISSN 2542-1956 (Online)


For citation:

Kataev A. V., Kataeva T. M., Makarova E. L. Dynamic Partner Network Core: Economic-Mathematical Tools. Journal Izvestiya of Saratov University. Economics. Management. Law, 2017, vol. 17, iss. 3, pp. 274-278. DOI: 10.18500/1994-2540-2017-17-3-274-278

This is an open access article distributed under the terms of Creative Commons Attribution 4.0 International License (CC-BY 4.0).
Full text PDF(Ru):
(downloads: 0)
Language: 
Russian
Heading: 
Article type: 
Article
UDC: 
005; 330.45

Dynamic Partner Network Core: Economic-Mathematical Tools

Autors: 
Kataev Alexey Vladimirovich, Southern Federal University
Kataeva Tatiana Mikhailovna, Southern Federal University
Makarova Elena Lvovna, Southern Federal University
Abstract: 

Introduction. At present the most actual form of economic research for the authors is a dynamic partner network that can be rapidly rearranged in response of market changes. The greatest difficulty in this case is the problem of the core development structure, the members of which shall have all, without exception, the required core competencies for search and performance of the market orders main stream. Theoretical analysis. A sufficiently large number of models and methods is developed, which can solve this problem, but their use in practice, as a rule, does not guarantee an exact optimal solution and often describes special cases permission. Methodology and results of the study. In this research paper the mathematical problem of integer linear programming about development of the minimum number in partner group, covering all the required core competencies of dynamic network is formulated by authors. The model provides the possibility of accounting relationships between partners, for example, the integration of economic agents only in the group that makes up the clique in terms of graph theory.

Reference: 
  1. Katayev A. V. Virtual’nie biznes-organizatsii [Virtual business organizations]. St. Petersburg, 2009. 120 p. (in Russian).
  2. Johnson S. M. Optimal two- and three-stage production schedules with setup times included. Nav. Res. Log. Quart., 1954, vol. 1, no. 1, pp. 61‒68.
  3. Manne A. S. On the Job-Shop Scheduling Problem. Operat. Res., 1960, vol. 8, no. 2, pp. 219‒223.
  4. Kataev A. V. Kataeva T. M. Zadachi minimizatsii kolichestva ispolniteley rabot v proyekte: matematicheskaya model’ i algoritm resheniya [The tasks of minimization the number of contractors in the project: mathematical model and solution algorithm]. Ekonomika i sotsium [Economy and Society], 2016, no. 6 (25), pp. 77–84 (in Russian).
  5. Kataev A. V. Kataeva T. M. Mezhorganizatsionnye setevye struktury: problemy organizatsii i upravleniya [Inter-organizational network structures: problems of organization and management]. Konkurentosposobnost’ v global’nom mire: ekonomika, nauka, tekhnologii [Competitiveness in a globalized world: economics, science, technologies], 2016, no. 7 (pt. 1), pp. 141–144 (in Russian).
Received: 
20.06.2017
Accepted: 
26.07.2017