S.YA. GUSEYNOV
CONSTRUCTING SUBOPTIMAL SOLUTION BASED ON ITS GEOMETRIC REPRESENTATION AND THE PRINCIPLE OF SIMULTANEOUS SELECTION OF TWO UNKNOWN IN A BOOLEAN PROGRAMMING PROBLEM
In this paper, a method is developed for constructing suboptimal solution based on its geometric representation in a Boolean programming problem. This method is based on the principle of simultaneous selection of two unknown values. In the case where such a choice does not take, then the process continues to calculate the known choice of unknowns by one. Computational experiments have shown that this approach is more efficient than known methods.
Keywords: suboptimal solution for Boolean programming, selection criterion for two unknowns, the computational experiments
CONSTRUCTING SUBOPTIMAL SOLUTION BASED ON ITS GEOMETRIC REPRESENTATION AND THE PRINCIPLE OF SIMULTANEOUS SELECTION OF TWO UNKNOWN IN A BOOLEAN PROGRAMMING PROBLEM
In this paper, a method is developed for constructing suboptimal solution based on its geometric representation in a Boolean programming problem. This method is based on the principle of simultaneous selection of two unknown values. In the case where such a choice does not take, then the process continues to calculate the known choice of unknowns by one. Computational experiments have shown that this approach is more efficient than known methods.
Keywords: suboptimal solution for Boolean programming, selection criterion for two unknowns, the computational experiments