Abstract
Weakly determinate problems of Boolean programming comprise those in which the objective function or set of admissible solutions is partially but not completely specified. Using the properties of the monotonic Boolean functions which correspond to the constraints of the Boolean linear programming problems, an approach is given for constructing a complete definition of the partially specified set of admissible solutions, and for finding the optimal solutions in the completed definition. To check that the solutions obtained are admissible, a recognition algorithm for the class of admissible solutions is employed.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: USSR Computational Mathematics and Mathematical Physics
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
