Abstract
This note treats a bottleneck integer allocation problem. The results obtained supercede those in this Journal due to Zeitlin (Zeitlin, Z. 1981. Integer allocation problems of min-max type with quasiconvex separable functions. Opns. Res. 29 207–211.), who has considered a similar allocation problem with a strictly quasiconvex objective function.
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.
