Author:
Zimin A V,Burkova I V,Kravets O Ja,Zimin V V
Abstract
Abstract
The generalized dual problem (GDP) is formulated as a search task of the upper bound minimum (lower bound maximum) for the optimum obtained by solving discrete linear and nonlinear problems by the network programming method. The need for GDP solution arises when, in order to meet the applicability conditions of the method, the right side of the constraint is divided into several unknown summands. The GDP consists in finding of such a partition that ensures achievement of corresponding minimum (maximum). There is no evidence for an existence of the GDP solution for today. However, the conditions for the GDP optimum solution have been formulated. The article proposes an iterative mechanism for search solution of the generalized dual problem. This mechanism is based on the software implementation of the procedure for solving the optimization problem by means of network programming. The application of the mechanism is illustrated on the developing competences task of IT services users. It was shown that the GDP solution exists and is not the only one.
Subject
General Physics and Astronomy
Reference11 articles.
1. Formation of functional volume and working groups of erp-project of the enterprise;Zimin;Izvestiya Ferrous Metallurgy,2017
2. Architecture of Combined e-Learning Environment and Investigation of Secure Access and Privacy Protection International;Romansky;Journal of Human Capital and Information Technology Professionals (IJHCITP),2016
3. Survey of Informatization and Privacy in the Digital Age and Basic Principles of the New Regulation;Romansky;International Journal on Information Technologies and Security,2019
4. Games with incomplete information played by “Bayesian” players;Harsanyi;Management Sci,1967
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. The mechanisms of initiative projects stimulating;Journal of Physics: Conference Series;2020-11-01