METHOD OF THE SOLUTION OF SOME CLASSES OPTIMISING TASKS

The relevance of this work is caused by wide circulation in all spheres of activity of important practical tasks which can be solved by methods of linear programming. The main difficulty at application of a universal way of the solution of such tasks (a simplex - a method) is its computing complexity. For the solution of this problem special methods of the solution of private problems of linear programming, for example, are developed for positive or limited basic data. These special cases are proved by economic, social, technical, technological sense. In this article the method maximizing linear function at one linear restriction with positive coefficients is developed. This method is generalized on a case of maximizing linear function at several linear restrictions. The received theoretical results are proved by the proof of the corresponding theorems. For an illustration of the received results numerical examples are given. The algorithmic complexity of the developed method is estimated for solvable tasks by calculation of number of the used operations and comparison with their quantity when using a simplex - a method. The received results allow to solve applied optimizing problems in various areas, including in problems of planning of production, a balanced diet and a diet, management of educational process, etc.

1. Bazilevsky M.P. Selection of informative regressors taking into account multicollinearity between them in regression models as a problem of partial and Boolean linear programming // Modelling, optimization and information technologies. 2018. 2 (22). Page 104-118.

2. Bazilevsky M. P. Data of a problem of selection of informative regressors at estimation of linear regression model by a method of the smallest squares to a problem of partial and Boolean linear programming // Modelling, optimization and information technologies. 2018. No. 1 (20). Page 108-117.

3. Sumin V.I., Kuznetsova L.D., Lukin M.A. Determination of coefficients of mathematical model of quality management of training by method of linear programming // Modelling, optimization and information technologies. 2018. No. 3 (22). Page 214-222.

4. Ganicheva A.V. Mathematical model of assessment of quality of training // In the world of discoveries. 2015. No. 61 (66). Page 313-326.

5. Ganicheva A.V., Ganichev A.V. Optimum planning of class periods // Sb.: Education in the 21st century: Materials of Vseross. конф. Tver: TGTU, 2009. Page 234 – 238.

6. Ganicheva, A.V. Matrix game of placement of counseling centers / /European magazine of social sciences. 2011. No. 9 (12). C. 424–429.

7. Ganicheva, A.V. Model of quality management of curricula // Quality. Innovations. Education. 2012. No. 4 (83). Page 37-41.

8. Ganicheva, A.V. To a question of formation of innovative personnel potential // Sb.: Strategic development of innovative capacity of agrarian and industrial complex of the region: Materials of the All-Russian scientific and practical conference. Tver: TGSHA, 2013. Page 164-167.

9. Ganicheva A.V. Use of information technologies for the organization of protection of motor transportation parks//Sb.: Perspective technical solutions in the sphere of operation of motor transportation and farm vehicles: Materials XXII of the All-Russian scientific and practical conference. Tver: TGSHA, 2013. Page 98-102.

10. Ganicheva, A.V. Systems in crop production//Sb.: Innovative and nanotechnologies in the system of strategic development of agrarian and industrial complex of the region: Materials XXII of the All-Russian scientific and practical conference. Tver: TGSHA, 2013. Page 271-274.

11. Ganichev A.V., Ganicheva A.V. Mathematical programming. Tver, 2017. 88 pages.

12. Yudin D. B., Golstein E.G. Linear programming. Theory, methods and applications. M.: Science, 1969. 424 pages.

13. Shevchenko V.N. Linear programming: history, achievements, problems // Bulletin of the Nizhny Novgorod university of N.I. Lobachevsky. Series: Mathematical modeling and optimum control. 2003. No. 1. Page 216-227.

14. Pudova M.V. New algorithms of the solution of problems of linear programming with special structure // Diskretn. analysis and исслед. operas., it is gray. 2. – 2002. volume 9. No. 1. Page 78-98.

15. Fomin S.A. A fast-approximate algorithm for a problem of positive linear programming // Works ISP RAS. 2004. Tom: 6 Pages 27-40.

16. Ganicheva, A.V. Solution of some classes of optimizing tasks//Sb.: Modeling and analysis of information systems. Mathematics, Applied Mathematics series: Materials of the international scientific conference devoted to the 35 anniversary математ. faculty and to the 25 anniversary of faculty of informatics and computer facilities of YaGU of P.G. Demidov. Yaroslavl: YarGU, 2012. Page 94-97.