Abstract: This paper investigates the procedures of sequential analysis and sifting of unpromising variants after restrictions and after the restriction on the goal function. On the basis of the modified procedure W and the general scheme of sequential analysis, the algorithm of solving the linear ordering problem is developed for the problems of discrete optimization.

Keywords: the linear ordering problem, the sequential analysis of variants.

ACM Classification Keywords: H.4.2 Information Systems Applications: Types of Systems: Decision Support.

Link:

PROCEDURES OF SEQUENTIAL ANALYSIS AND SIFTING OF VARIANTS FOR THE LINEAR ORDERING PROBLEM

Pavlo Antosiak, Oleksij Voloshyn

http://www.foibg.com/ibs_isc/ibs-15/ibs-15-p19.pdf