<?xml version='1.0' encoding='utf-8'?>
<!DOCTYPE article PUBLIC "-//NLM//DTD JATS (Z39.96) Journal Publishing DTD v1.2 20190208//EN" "http://jats.nlm.nih.gov/publishing/1.2/JATS-journalpublishing1.dtd">
<article article-type="research-article" dtd-version="1.2" xml:lang="ru" xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"><front><journal-meta><journal-id journal-id-type="issn">2518-1092</journal-id><journal-title-group><journal-title>Research result. Information technologies</journal-title></journal-title-group><issn pub-type="epub">2518-1092</issn></journal-meta><article-meta><article-id pub-id-type="doi">10.18413/2518-1092-2016-1-1-12-17</article-id><article-id pub-id-type="publisher-id">54</article-id><article-categories><subj-group subj-group-type="heading"><subject>COMPUTER SIMULATION</subject></subj-group></article-categories><title-group><article-title>DEVELOPMENT OF METHODS FOR SOLVING THE TASKS OF THE CONTINIUM LINEAR PROGRAMMING USING LEGENDRE POLYNOMIALS</article-title><trans-title-group xml:lang="en"><trans-title>DEVELOPMENT OF METHODS FOR SOLVING THE TASKS OF THE CONTINIUM LINEAR PROGRAMMING USING LEGENDRE POLYNOMIALS</trans-title></trans-title-group></title-group><contrib-group><contrib contrib-type="author"><name-alternatives><name xml:lang="ru"><surname>Pihnastyi</surname><given-names>Oleh Miailovich</given-names></name><name xml:lang="en"><surname>Pihnastyi</surname><given-names>Oleh Miailovich</given-names></name></name-alternatives><email>pom7@bk.ru</email></contrib></contrib-group><pub-date pub-type="epub"><year>2016</year></pub-date><volume>1</volume><issue>1</issue><fpage>0</fpage><lpage>0</lpage><self-uri content-type="pdf" xlink:href="/media/information/2016/1/it2_vwBozUe.pdf" /><abstract xml:lang="ru"><p>The article demonstrates the theoretical foundations of the mathematical apparatus − the continuum of linear programming. It demonstrates a technique for solving problems with the use of orthogonal systems of functions. The article was an exact solution of the problem of variational calculus to linear constraints. The purpose of the work is to develop accurate methods of solving the problem in the class of Legendre polynomials. The study demonstrates an ability to build the exact solution of the problem and the conditions under which the decision is allowed. Based on the properties of Legendre polynomials, an exact solution of the problem of continual linear programming is provided, in which the integrands and functional limitations are presented in rows of finite degree. Analytically, it is proven that the solution obtained is a limiting case of the linear combination of delta functions. It is shown that the parameters of the optimization problem of finding the unknown functions plan contains half of the variables than in the canonical method. Recommendations are given for the construction of the optimization algorithm. There is a possibility of extending the proposed technology solution in the direction of using other systems of orthogonal polynomials.</p></abstract><trans-abstract xml:lang="en"><p>The article demonstrates the theoretical foundations of the mathematical apparatus − the continuum of linear programming. It demonstrates a technique for solving problems with the use of orthogonal systems of functions. The article was an exact solution of the problem of variational calculus to linear constraints. The purpose of the work is to develop accurate methods of solving the problem in the class of Legendre polynomials. The study demonstrates an ability to build the exact solution of the problem and the conditions under which the decision is allowed. Based on the properties of Legendre polynomials, an exact solution of the problem of continual linear programming is provided, in which the integrands and functional limitations are presented in rows of finite degree. Analytically, it is proven that the solution obtained is a limiting case of the linear combination of delta functions. It is shown that the parameters of the optimization problem of finding the unknown functions plan contains half of the variables than in the canonical method. Recommendations are given for the construction of the optimization algorithm. There is a possibility of extending the proposed technology solution in the direction of using other systems of orthogonal polynomials.</p></trans-abstract><kwd-group xml:lang="ru"><kwd>continual linear programming</kwd><kwd>Legendre polynomials</kwd><kwd>delta function</kwd></kwd-group><kwd-group xml:lang="en"><kwd>continual linear programming</kwd><kwd>Legendre polynomials</kwd><kwd>delta function</kwd></kwd-group></article-meta></front><back><ref-list><title>Список литературы</title><ref id="B1"><mixed-citation>Raskin L.G., Kirichenko I.O., Seraja O.V. Applied Linear Continual Programming. Harkov: Oberig, 2014. 292 p.</mixed-citation></ref><ref id="B2"><mixed-citation>Lesnik С., Opilski Z., Pustelny T. The Numerical Synthesis of a Radar Signal Based on Iterative Method // Acta Physica Polonica. 2011. №4 (120). Pp. 693-697.</mixed-citation></ref><ref id="B3"><mixed-citation>Kabakchiev А., Kyovtorov V., Bedzev B., Numerical Analysis of Different Communication Signals. Cybernetics and Information Technologies. 2010. №4 (10). С. 75-90.</mixed-citation></ref><ref id="B4"><mixed-citation>Dancig D.V. Linear Programming, its Application and Generalisation. M.: PROGRESS, 1966. 600 p.</mixed-citation></ref><ref id="B5"><mixed-citation>Lebedev N.N. Special Functions and their Applications. Moskva-Leningrad: Fizmatgiz, 1963. 360 p.</mixed-citation></ref></ref-list></back></article>