A maxmin location problem with nonconvex feasible region

作     者：Fernandez, F Puerto, J RodriguezChia, AM 

作者机构：UNIV SEVILLADEPT ESTADIST & INVEST OPERATSEVILLESPAIN UNIV CADIZCADIZSPAIN 

出 版 物：《JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY》 (J.Oper.Res.Soc.)

年 卷 期：1997年第48卷第5期

页      面：479-489页

核心收录：

学科分类：12[管理学] 1201[管理学-管理科学与工程(可授管理学、工学学位)] 07[理学] 070105[理学-运筹学与控制论] 0701[理学-数学] 

主　　题：location obnoxious facility non-convex programming 

摘      要：The problem dealt with consists of locating a point in a given convex polyhedron which maximizes the minimum Euclidean distance from a given set of convex polyhedra representing protected areas around population points. The paper describes a finite dominating solution set for the optimal solution and develops a geometrical procedure for obtaining the optimal solution comparing a finite number of candidates.