Resource allocation among competing activities: a lexicographic minimax approach |
| |
| Affiliation: | 1. Bar-Ilan University, Ramat Gan, Israel;2. Clalit Health Services, Israel;3. Technion, Haifa, Israel;1. School of Management Engineering, Zhengzhou University of Aeronautics, Zhengzhou, China;2. Departments of Mechanical and Manufacturing Engineering, University of Calgary, Calgary, Canada;3. School of Mechanical Engineering, Shanghai Jiao Tong University, Shanghai, China;1. Department of Clinical Medicine, School of Medicine, Zhejiang University City College, Hangzhou, China;2. Research Center of Chinese Jujube, Hebei Agriculture University, Baoding, China;3. Lindsley F. Kimball Research Institute, New York Blood Center, New York, USA;4. Key Laboratory of Medical Molecular Virology (MOE/NHC/CAMS), School of Basic Medical Sciences, Fudan University, Shanghai, China |
| |
| Abstract: | We examine an allocation problem in which the objective is to allocate resources among competing activities so as to balance weighted deviations from given demands. A lexicographic minimax algorithm that solves successive problems by A minimax optimizer is developed. The algorithm is extremely fast and can readily solve large-scale problems that may be encountered in applications, e.g., in production planning. |
| |
| Keywords: | |
| 本文献已被 ScienceDirect 等数据库收录！ |
|
