首页 | 本学科首页   官方微博 | 高级检索  
     检索      


On the feasible set for the squared Euclidean Weber problem and applications
Institution:1. Lakeside Labs GmbH, 9020-Klagenfurt, Austria;2. Department of Mathematics, Alpen-Adria-Universität Klagenfurt, 9020-Klagenfurt, Austria;1. Central Research Institute of Epidemiology, 111123, Novogireevskaya st. 3A, Moscow, Russia;2. Research Institute of Applied Biology of Guinea, Pastoria, CREMS, Kindia, Guinea;3. State Research Center of Virology and Biotechnology «Vector», 630559, Kol''tsovo, Novosibirsk Oblast, Russia;4. International Center for Research of Tropical Infections in Guinea, N''Zerekore, Guinea;5. Russian Research Anti-Plague Institute «Microbe», 410005, Universitetskaya st. 46, Saratov, Russia;6. Federal State Budgetary Institution «Centre for Strategic Planning and Management of Biomedical Health Risks» of the Federal Medical Biological Agency, 119435 Moscow, Russia;7. Moscow Institute of Physics and Technology, National Research University, Phystech School of Biological and Medical Physics, 117303 Moscow, Russia
Abstract:In this paper we find the set of feasible solution points to the Weber location problem with squared Euclidean distances when the weights can be at any point in a given set of intervals. We prove that this set is a convex polygon. The result is then used to solve the minimax regret objective when individual scenarios can be any set of weights in a given set of intervals.
Keywords:
本文献已被 ScienceDirect 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号