Entity

Time filter

Source Type


Iemets O.A.,Poltava University of Consumer Cooperatives | Leonova M.V.,The National Pedagogical University
Journal of Automation and Information Sciences | Year: 2014

We obtain simplex form of the general permutable polyhedron, given by irreducible system of linear constraints, by means of its transformation with usage of algorithm of transformation of linear programming problems in the standard form to the form, required for usage of the Karmarkar algorithm. Illustrative example was considered. © 2014 by Begell House Inc. Source


Iemets O.A.,Poltava University of Consumer Cooperatives | Chernenko O.A.,Poltava University of Consumer Cooperatives
Journal of Automation and Information Sciences | Year: 2013

Exact combinatorial method for solving the problems of discrete optimization with linear-fractional objective function is under consideration. The algorithm of branch and bound method was constructed for solving the mentioned problem. © 2013 by Begell House Inc. Source


Iemets O.A.,Poltava University of Consumer Cooperatives | Yemets Ye.M.,Poltava University of Consumer Cooperatives | Olhovskiy D.N.,Poltava University of Consumer Cooperatives
Journal of Automation and Information Sciences | Year: 2012

A method of analysis of vertices of a permutable polyhedron graph for solving linear conditional optimization problems on the permutations is suggested. Its implementation for a multiprocessor system is proposed. The complexity of the algorithm is theoretically investigated. © 2012 by Begell House Inc. Source


Yemets O.A.,Poltava University of Consumer Cooperatives | Yemets Ye.M.,Poltava University of Consumer Cooperatives | Chilikina T.V.,Poltava University of Consumer Cooperatives
Journal of Automation and Information Sciences | Year: 2011

The paper has constructed the mathematical model for the problem of the work optimization of multiprocessing computer system as Euclidian combinatorial optimization problem on a vertex-located set. The theorem about the existence conditions of possible solutions for such problems have been formulated and proved. The method for solving such type problems as the extension of combinatorial cutting method has been proposed. © 2011 by Begell House Inc. Source


Iemets O.A.,Poltava University of Consumer Cooperatives | Yemets A.O.,Poltava University of Consumer Cooperatives | Parfonova T.A.,Poltava University of Consumer Cooperatives
Journal of Automation and Information Sciences | Year: 2013

The algorithm of branch and bound method for the problem of minimization in fuzzy statement is suggested. Usage of the branch and bound method for combinatorial transportation problem on permutations with fuzzy data is shown. © 2013 by Begell House Inc. Source

Discover hidden collaborations