Algorithm for the simplification of solution to discrete optimization problems

Abstract

<p>Typically, the search for solutions in discrete optimization problems is associated with fundamental computational difficulties. The known methods of accurate or approximated solution of such problems are studied talking into consideration their belonging to so-called problems from <strong>P</strong> and <strong>NP</strong> class (algorithms for polynomial and exponential implementation of solution). Modern combinatorial methods for practical solution of discrete optimization problems are focused on the development of algorithms which allow obtaining an approximated solution with guaranteed evaluation of deviations from the optimum. Simplification algorithms are an effective technique of the search for solutions to an optimization problem. If we make a projection of a multi-dimensional process onto a two-dimensional plane, this technique will make it possible to clearly display a set of all solutions to the problem in graphical form. The method for simplification of the combinatorial solution to the discrete optimization problem was proposed in the framework of this research. It is based on performance of decomposition of a system that reflects the system of constraints of the original five-dimensional original problem on a two-dimensional plane. This method enables obtaining a simple system of graphic solutions to a complex problem of linear discrete optimization. From the practical point of view, the proposed method enables us to simplify computational complexity of optimization problems of such a class. The applied aspect of the proposed approach is the use of obtained scientific results in order to provide a possibility to improve the typical technological processes, described by systems of linear equations with existence of systems of linear constraints. This is a prerequisite for subsequent development and improvement of similar systems. In this study, the technique for decomposition of a discrete optimization system through projection of an original problem on two-dimensional coordinate planes was proposed. In this case, the original problem is transformed to a combinatorial family of subsystems, which makes it possible to obtain a system of graphic solutions to a complex problem of linear discrete optimization.</p>

Authors and Affiliations

Sergii Chernov, Sergiy Titov, Lyudmila Chernova, Viktor Gogunskii, Liubava Chernova, Kateryna Kolesnikova

Keywords

Related Articles

Development of method of multifactor classification of transport and logistic processes

<p class="a">A method of classification of a set of objects and/or processes in transport and logistics systems on the basis of a multifactor analysis was proposed.</p><p class="a">Combination of the methods of statistic...

The influence of the pack decarburizing process with Pinctada maxima shell powder agent on the properties of high carbon steel

<p>In the present study, ductility enhancement of high carbon steel AISI 420 was conducted by pack decarburizing method to improve mechanical properties of this steel. This specimen was placed in a rectangular box contai...

Synthesis of the structure of functional systems of conversion class with a portional supply of initial products

<p>The main efforts related to enterprise creation and development are aimed at improving efficiency of resource usage in the enterprise activities. Such problem can be successfully solved only if maximum efficiency is a...

Characteristics of radiolocation scattering of the Su­25T attack aircraft model at different wavelength ranges

This paper demonstrates that mathematical modeling makes it possible to build and explore radiolocation profiles of modern and advanced aircraft. Construction and studying mathematical models based on modern information...

Determining the rational modes for low-temperature storage and for obtaining products of Japanese Quince processing with high consumer properties

<p>The article reports a comprehensive study into the rational modes for low- temperature storage and for obtaining the products of Japanese Quince processing with high consumer indicators by examining the kinetics of fr...

Download PDF file
  • EP ID EP527978
  • DOI 10.15587/1729-4061.2018.133405
  • Views 54
  • Downloads 0

How To Cite

Sergii Chernov, Sergiy Titov, Lyudmila Chernova, Viktor Gogunskii, Liubava Chernova, Kateryna Kolesnikova (2018). Algorithm for the simplification of solution to discrete optimization problems. Восточно-Европейский журнал передовых технологий, 3(4), 34-43. https://europub.co.uk/articles/-A-527978