Efficiency in constrained continuous location

European Journal of Operational Research

Volumn 104, Issue 2, 1998, Pages 288-298

  Ndiaye, M ^a   Michelot, C ^b  

^a UNIVERSITÉ DE BOURGOGNE   (France)

^b UNIVERSITÉ DE BOURGOGNE   (France)

Author keywords

Continuous location; Efficiency with constraints

Indexed keywords

CONSTRAINT THEORY; DISTANCE MEASUREMENT; LOCATION; PROBLEM SOLVING;

CONTINUOUS LOCATION; EFFICIENCY WITH CONSTRAINTS; MULTIOBJECTIVE LOCATION PROBLEMS; PROJECTION PROPERTY;

OPERATIONS RESEARCH;

EID: 0031647271     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0377-2217(97)00184-7     Document Type: Article

References (20)

1. E. Carrizosa, E. Conde, F.R. Fernandez, J. Puerto, Efficiency in spatial location problems with non convex constraint, Journal of Global Optimization 6 (1995) 77-86.
2. E. Carrizosa, E. Conde, F.R. Fernandez, J. Puerto, Efficiency in Euclidean constrained location problems, Operations Research Letters 14 (1993) 291-295.
3. E. Carrizosa, F. Plastria, A characterization of efficient points in constrained location with regional demand, Operations Research Letters 19 (1996) 129-134.
4. E. Carrizosa, F. Plastria, Geometrical characterization of weakly efficient points, Journal of Optimization Theory and Applications 90 (1996) 217-223.
5. R. Durier, Sets of efficiency in a normed space and inner product, in: J. Jahn, W. Krabs (Eds.), Lecture Notes in Econom. and Math. Systems, Recent Advances and Historical Development of Vector Optimization, 1987, pp. 114-128.
6. R. Durier, On Pareto optima, the Fermat-Weber problem and polyhedral gauges, Mathematical Programming 47 (1990) 65-79.
7. R. Durier, C. Michelot, Set of efficient points in a normed space, Journal of Mathematical Analysis and Applications 117 (1986) 506-528.
8. B. Pelegrin, F.R. Fernandez, Determination of efficient points in multiple-objective location problems, Naval Research Logistics 35 (1988) 697-705.
9. F. Plastria, Continuous location problems and cutting plane algorithms, Thesis, Vrije Universiteit Brussel, 1983.
10. R.E. Wendell, A.P. Hurter, Location theory, dominance and convexity, Operations Research 21 (1973) 314-321.
11. R.E. Wendell, A.P. Hurter, T.J. Lowe, Efficient points in location problems, AIIE Transactions 9 (1977) 238-246.
12. R. Durier, C. Michelot, Geometrical properties of the Fermat-Weber problem, European Journal of Operational Research 20 (1985) 332-342.
13. R. Durier, C. Michelot, On the set of optimal points to the Weber problem: further results, Transportation Science 28 (1994) 141-149.
14. C. Michelot, Localization in multifacility location theory, European Journal of Operational Research 31 (1987) 117-184.
15. E. Carrizosa, E. Conde, M. Munoz, J. Puerto, Simpson points in planar problems with locational constraints. The round norm case, Mathematics of Operations Research 22 (1997) 276-290.
16. E. Carrizosa, E. Conde, M. Munoz, J. Puerto, Simpson points in planar problems with locational constraints. The polyhedral norm case, Mathematics of Operations Research 22 (1997) 291-300.
17. R.T. Rockafellar, Convex Analysis, Princeton Univ. Press, Princeton, NJ, 1970.
18. A.L. Brown, Best n-dimensional approximation to sets of functions, Proceedings of the London Mathematical Society, vol. 14, 1964, pp. 577-594.
19. E. Klein, A. Thompson, Theory of Correspondences, Canadian Mathematical Society, Wiley/Interscience, New York, 1984.
20. A.R. Waburton, Quasiconcave vector maximization: connectedness of the sets of Pareto-optimal and weak Paretooptimal alternatives, Journal of Optimization Theory and Applications 40 (1983) 537-557.