General models in min-max continuous location: Theory and solution techniques

Journal of Optimization Theory and Applications

Volumn 89, Issue 1, 1996, Pages 39-63

  Frenk, J B G ^a   Gromicho, J ^b   Zhang, S ^a  

^a ERASMUS UNIVERSITY ROTTERDAM   (Netherlands)

^b UNIVERSITY OF LISBON   (Portugal)

Author keywords

Ellipsoid algorithm; Location theory; Min max programming; Quasiconvexity

Indexed keywords

LOCATION;

CONTINUOUS LOCATIONS; ELLIPSOID ALGORITHM; GENERAL MODEL; LOCATION PROBLEMS; LOCATION THEORY; MIN-MAX; MIN-MAX PROGRAMMING; QUASI CONVEXITY; SOLUTION TECHNIQUES; STATIONARY POINTS;

COMPUTATION THEORY;

EID: 0030539473     PISSN: 00223239     EISSN: None     Source Type: Journal    
DOI: 10.1007/BF02192640     Document Type: Article

References (34)

1. ROCKAFELLAR, R. T., Convex Analysis, Princeton University Press, Princeton, New Jersey, 1972.
2. MICHELOT, C., The Mathematics of Continuous Location, Studies in Locational Analysis, ISOLDE VI Survey Papers, Vol. 5, pp. 59-83, 1993.
3. IDRISSI, H., LORIDAN, P., and MICHELOT, C., Approximation of Solutions for Location Problems, Journal of Optimization Theory and Applications, Vol. 56, pp. 127-143, 1988.
4. WARD, J. E., and WENDELL, R. E., Using Block Norms for Location Modeling, Operations Research, Vol. 33, pp. 1074-1090, 1985.
5. LOVE, R. F., and MORRIS, J. G., Modelling Intercity Road Distances by Mathematical Functions, Operational Research Quarterly, Vol. 23, pp. 61-71, 1972.
6. BERENS, W., and KOERLING, F. J., Estimated Road Distances by Mathematical Functions, European Journal of Operational Research, Vol. 21, pp. 54-56, 1972.
7. WARD, J. E., and WENDELL, R. E., A New Norm for Measuring Distance Which Yields Linear Location Problems, Operations Research, Vol. 28, pp. 836-844, 1980.
8. PLASTRIA, F., On Destination Optimality in Asymmetric Distance Fermat-Weber Problems, Annals of Operations Research, Vol. 40, pp. 355-369, 1992.
9. MARTI, J. T., Konvexe Analysis, Birkhauser Verlag, Basel, Switzerland, 1977.
10. PLASTRIA, F., Continuous Location Anno 1992: A Progress Report, Studies in Locational Analysis, ISOLDE VI Survey Papers, Vol. 5, pp. 85-127, 1993.
11. LOVE, R. F., MORRIS, J. G., and WESOLOWSKY, G. O., Facility Location: Models and Methods, Elsevier Science Publishers B.V., North Holland, Amsterdam, Netherlands, 1988.
12. RUDIN, W., Principles of Mathematical Analysis, 3rd Edition, McGraw-Hill, Auckland, New Zealand, 1976.
13. n, American Mathematical Monthly, Vol. 86, pp. 585-586, 1979.
14. PLASTRIA, F., Localization in Single Facility Location, European Journal of Operational Research, Vol. 18, pp. 215-219, 1984.
15. WENDELL, R. E., and HURTHER, A. P., JR., Location Theory, Dominance, and Convexity, Operations Research, Vol. 21, pp. 314-320, 1973.
16. PSHENICHNYI, B. N., Necessary Conditions for an Extremum, Marcel Dekker, New York, New York, 1971.
17. FRENK, J. B. G., GROMICHO, J., and ZHANG, S., General Models in Min-Max Planar Location: Checking Optimality Conditions, Journal of Optimization Theory and Applications, Vol. 89, pp. 65-87, 1996.
18. AVRIEL, M., DIEWERT, W. E., SCHAIBLE, S., and ZANG, I., Generalized Concavity, Plenum Press, New York, New York, 1988.
19. KOMLÓSI, S., Some Properties of Nondifferentiable Pseudoconvex Functions, Mathematical Programming, Vol. 26, pp. 232-237, 1983.
20. n, Lecture Notes in Control and Information Sciences, Springer Verlag, New York, New York, Vol. 30, pp. 9-20, 1981.
21. HIRIART-URRUTY, J. B., and LEMARÉCHAL, C., Convex Analysis and Minimization Algorithms, I: Fundamentals, Comprehensive Studies in Mathematics, Springer Verlag, Berlin, Germany, Vol. 305, 1993.
22. FRENK, J. B. G., GROMICHO, J., and ZHANG, S., A Deep-Cut Ellipsoid Algorithm for Convex Programming: Theory and Applications, Mathematical Programming, Vol. 63, pp. 83-108, 1994.
23. SHOR, N. Z., and GERSHOVICH, V. I., Family of Algorithms for Solving Convex Programming Problems, Cybernetics, Vol. 15, pp. 502-508, 1979.
24. ORTEGA, J. M., and RHEINBOLDT, W. C., Iterative Solutions of Nonlinear Equations in Several Variables, Academic Press, New York, New York, 1970.
25. VARBERG, D. E., and ROBERTS, A. W., Convex Functions, Academic Press, New York, New York, 1973.
26. PLASTRIA, F., Lower Subdifferentiable Functions and Their Minimization by Cutting Planes, Journal of Optimization Theory and Applications, Vol. 46, pp. 37-53, 1985.
27. MARTINEZ-LEGAZ, J. E., On Lower Subdifferentiable Functions, Trends in Mathematical Optimization, Edited by K. H. Huffman, J. B. Hiriart-Urruty, C. Lemaréchal, and J. Zowe, Birkhäuser Verlag, Basel, Switzerland, 1988.
28. FRENK, J. B. G., GROMICHO, J., PLASTRIA, F., and ZHANG, S., A Deep-Cut Ellipsoid Algorithm and Quasiconvex Programming, Generalized Convexity, Edited by S. Komlósi, T. Rapcsák, and S. Schaible, Springer Verlag, New York, New York, pp. 62-76, 1994.
29. BLAND, R. G., GOLDFARB, D., and TODD, M. J., The Ellipsoid Method: A Survey, Operations Research, Vol. 29, pp. 1039-1091, 1981.
30. GRÖTSCHEL, M., LOVÁSZ, L., and SCHRIJVER, A., Geometric Algorithms and Combinatorial Optimization, Springer Verlag, Berlin, Germany, 1988.
31. DZIUBAN, S. T., ECKER, J. G., and KUPFERSCHMID, M., Using Deep Cuts in an Ellipsoid Algorithm for Nonlinear Programming, Mathematical Programming Study, Vol. 25, pp. 93-107, 1985.
32. GOFFIN, J. L., Convergence Rates of the Ellipsoid Method on General Convex Functions, Mathematics of Operations Research, Vol. 8, pp. 135-150, 1983.
33. SHOR, N. Z., Utilization of the Operation of Space Dilation in the Minimization of Convex Functions, Cybernetics, Vol. 6, pp. 7-15, 1970.
34. LUTHI, H. J., On the Solution of Variational Inequalities by the Ellipsoid Method, Mathematics of Operations Research, Vol. 10, pp. 515-522, 1985.