Abstract
AT the recent International Conference on Operational Research, B. 0. Koopman' posed an interesting class of problems in the Combinatorial Analysis of Operations. Koopman defined the class of problem and then considered a simple example of that class, obtaining rough upper and lower limits to the numerical quantity required. In these notes I consider this simple example and obtain limits which are closer than those obtained by Koopman. Lastly, I consider the class of problems to which the approximate methods given here may be extended.
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 callDisclaimer: 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.
