K.SH. MAMMADOV, N.O. MAMMADLI
METHODS OF APPROXIMATE SOLUTION OF MIXED-BOOLEAN PROGRAMMING PROBLEMS WITH INTERVAL DATA


The authors introduce concepts of feasible, optimistic, pessimistic, suboptimistic and subpessimistic solutions of mixed-Boolean programming problems with interval data. Methods are developed for the construction of suboptimistic and subpessimistic solutions. Numerous computational experiments are carried out on different large-scale problems with random coefficients and these experiments again confirm high efficiency of the methods presented in the paper.

Keywords: mixed-Boolean programming problem with interval data, optimistic, pessimistic, suboptimistic and subpessimistic solutions, upper and low bounds, errors, computational experiments
© Copyright.
Copyright © 1997-2019 Institute of Control Systems of Azerbaijan National Academy of Sciences. e-Mail: [email protected]