INTEGRAL LATTICES ON A PLANE IN DISCRETE OPTIMIZATION PROBLEMS

V. Senchukov ()
Additional contact information
V. Senchukov: of Simon Kuznets Kharkiv National University of Economics

Economics of Development, 2014, vol. 71, issue 3, 107-112

Abstract: A novel approach to solving the problems of discrete (integer) optimization based on the numbering of points in the plane with integer coordinates, i. e. lattice points, is considered. An analytical description (in the closed form) of the whole point coordinates dependence on its number and the whole point number on its coordinates was found using the function antje. On this basis, it is proposed to avoid a preliminary solution of the problem of mathematical programming with weak constraints, i. e. excluding the requirements of integer variables, as in the methods of pruning and combinatorial methods. Finding the optimum of the objective function is carried out directly on the set of lattice points i. e. a subset of the domain of admissible values of variables.

Keywords: sequence; numbering; integer; formula; parametric equations; a series of zeros (ones); a network node; the number of a square; the objective function; the optimum (minimum; maximum); clipping methods; combinatorial methods; economics objectives (search for similar items in EconPapers)
Date: 2014
References: Add references at CitEc
Citations:

Downloads: (external link)
http://www.ed.ksue.edu.ua/ER/knt/eu143_71/e143sen.pdf

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:nos:zodgwl:e143sen.pdf

Access Statistics for this article

More articles in Economics of Development from Kharkiv National University of Economics
Bibliographic data for series maintained by Андрей Пилипенко ().