Chupov S.V.
New approaches to solving discrete programming problems based on lexicographic search

New approaches are proposed to the solution of discrete programming problems on the basis of searching for lexicographic vector ordering for which the optimal solution to a problem coincides with the lexicographic extremum of the set of feasible solutions of the problem or is located rather close to it in the lexicographic sense. A generalized scheme of this lexicographic search and possibilities of its modification are described. Considerable advantages of this approach over the standard lexicographic search algorithm in efficiency are illustrated. © 2016, Springer Science+Business Media New York.

Keywords: discrete programming problem, lexicographic maximum, lexicographic order, lexicographic search algorithm, Learning algorithms, Discrete programming, Feasible solution, lexicographic maximum, Lexicographic order, New approaches, Optimal solutions, Search Algorithms, Vector ordering, Problem solving

Cite:
Chupov S.V. (2016). New approaches to solving discrete programming problems based on lexicographic search. Cybernetics and Systems Analysis, 52 (4), 43-54. doi: https://doi.org/10.1007/s10559-016-9855-9 http://jnas.nbuv.gov.ua/article/UJRN-0001294503 [In Russian].