Теоретический подход и численный метод поиска квазиоптимального решения нелинейной дискретной задачи большой размерности

Abstract

At present, the class of NP-complete problems is represented not only by the «classical» issue of the travelling salesman problem and many tasks in the theory of graphs and networks, resolved into it, but also by the problems of nonlinear and stochastic optimization, including, in the discrete setting. The peculiarity of these problems is the lack of constructive algorithms forfinding the optimal solution in polynomial time from the dimension of the problem, which «dooms» the researcher to use non-constructive methods in solving these problems, for example, the exhaustive algorithm. However, these algorithms, being applied to discrete optimization problems, do not allow to solve the problem in a complex way: for example, such methods do not let us obtain dual constraints estimation that are important for the subsequent analysis of the optimal solution. In the article, for a wide class of problems of production and financial planning, which, in the production plan, are reduced to the problems of discrete nonlinear convex optimization of large dimension, the author offers an original numerical method for finding a quasi-optimal solution with a high (predetermined) accuracy of approximation to the optimum. For the specified class of problems, the proposed method is universal, i.e. it can be applied without additional adaptation of the numerical procedure.