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

Study of the free surface energy of epoxy composites using an automated measurement system

<p>Results of development of the automated measurement system (AMS) for determining contact wetting angles and calculations of components of free surface energy (FSE) of solid surfaces by the Van Oss-Chaudhury-Good metho...

Development of a technology for the surface strengthening of barrel channels in the large-caliber artillery guns

<p>High temperatures and exposure to the chemical effect of powder gases that accompany artillery salvos actively destroy the surface layer of a barrel channel material. This disrupts the geometry of a barrel channel, th...

Analysis of tribological efficiency of movable junctions "polymeric­composite materials ‒ steel"

<p>The paper reports an analysis into tribological efficiency of mating parts "polymeric-composite materials ‒ steel" is carried out. Improperly selected materials produce significant operating costs in terms of tribolog...

Development of a theoretical model for the intensification of technological processes for manufacturing dairy products

<p>A dependence is established between the amount and forms of calcium in milk and its technological purpose. It is proven that a controlled reduction in the content of calcium in milk (specifically, its ionic form) incr...

Study into the rolling of a double-layered powdered core in a metallic sheath

<p>We have developed an analytical model of the stressed-strained state of the two-layered powdered core in a metal sheath in the deformation zone when fabricating a composite material by rolling. Based on the constructe...

Download PDF file
  • EP ID EP527978
  • DOI 10.15587/1729-4061.2018.133405
  • Views 62
  • 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