BOOLEAN LINEAR-PROGRAMMING WITH INTERVAL-COEFFICIENTS

A general approach to the solution of the problem of discrete programm ing with undefined parameters in the form of intervals, based on the g eneral principles of comparing indefinite values, is considered. This approach reduces the problem to two analogous problems with determinis tic parameters that are the boundaries of the intervals indicated. The approach is presented for Boolean discrete programming, and the corre sponding necessary and sufficient conditions for existence of a soluti on, as well as an algorithm for its construction, are explained.