Ali Jamalian - Department of Computer science, Faculty of Mathematical sciences, University of Guilan, Rasht, Iran

In this paper, we consider the Euclidean continuous minimax location problem under uncertainty. We consider the single-facility and the multi-facility case with uncertain location of demand points and uncertain transportation costs. We study these two problems under two kinds of uncertainty, the interval and the ellipsoidal uncertainty. Equivalent formulations of robust counterparts of the single facility and multi facility Euclidean continuous minimax location problems under interval andellipsoidal uncertainty are given as conic optimizationproblems.

Continuous Minimax Location Problem, robust optimization, Second-Order Cone Programming, Semidefinite Programming