New Approaches to Solving Discrete Programming Problems on the Basis of Lexicographic Search

• Published in: Cybernetics and systems analysis Vol. 52; no. 4; pp. 536 - 545
• Main Author: Chupov, S. V.
• Format: Journal Article
• Language: English
• Published: New York Springer US 01-07-2016; Springer; Springer Nature B.V
• Subjects: Algorithms; Artificial Intelligence; Computer programming; Control; Cybernetics; Efficiency; Feasibility; Integer programming; Mathematical analysis; Mathematics; Mathematics and Statistics; Optimization; Processor Architectures; Programming; Searches; Searching; Software Engineering/Programming and Operating Systems; Studies; Systems Theory; Variables; Vectors (mathematics); United States > US; discrete programming problem; lexicographic order; lexicographic search algorithm; lexicographic maximum
• ISSN: 1060-0396; 1573-8337
• DOI: 10.1007/s10559-016-9855-9

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.