UDC 519.854

New approaches to solving discrete programming problems based on lexicographic search

/ S.V. Chupov // Kibernetika i sistemnyi analiz. — 2016. — Vol. 52, N 4. — P. 43–54.

The author proposes new approaches to solving discrete programming problems based on the search for lexicographical ordering of vectors, such that the optimal problem solution either coincides with the lexicographic extremum of the feasible set of problem solutions or is close enough to it in the lexicographic sense. The general scheme of such lexicographic search and the possibilities for its modification are described. Significant advantages in the efficiency of this approach compared with the the standard lexicographic search algorithm are illustrated. Figs: 7. Tabl.: 0. Refs: 7 titles.

Keywords:

lexicographical ordering, lexicographic maximum, discrete programming problem, lexicographic search algorithm.


FULL TEXT

Author(s):

Чупов Сергей Викторович, кандидат физ.-мат. наук, доцент Ужгородского национального университета,
e-mail: sergey.chupov@gmail.com