Abstract
This paper develops the dual formulation of a generalized minimax problem which has distance and linear constraints.
Similar content being viewed by others
References
S.D. Brady and R.E. Rosenthal, Interactive computer graphical solutions of constrained minimax location problems, AIIE Trans. 12(1980)241–248.
J. Brimberg, Properties of distance functions and minisum location models, Ph.D. Thesis, McMaster University, Ontario, Canada (1989).
Z. Drezner and G.O. Wesolowsky, A new method for the multifacility minimax location problem, J. Oper. Soc. 29(1978)1095–1101.
J. Elzinga, D. Hearn and W.D. Randolph, Minimax multifacility location with Euclidean distance, Transp. Sci. 10(1976)321–336.
R.F. Love, G.O. Wesolowsky and S.A. Kraemer, A multifacility minimax location method for Euclidean distances, Int. J. Prod. Res. 11(1973)37–45.
J.G. Morris, A linear programming approach to the solution of constrained multifacility minimax location problems where distances are rectangular, Oper. Res. Quarterly 24(1973)419–435.
J. Walker, An empirical study of round and block norms, Ph.D. Thesis, McMaster University, Hamilton, Ontario, Canada (1992).
G.O. Wesolowsky, Rectangular distance location under the minimax optimality criterion, Transp. Sci. 6(1972)103–113.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Juel, H., Love, R.F. The dual of a generalized minimax location problem. Ann Oper Res 40, 261–264 (1992). https://doi.org/10.1007/BF02060481
Issue Date:
DOI: https://doi.org/10.1007/BF02060481