1. Auslender, A.: Two general methods for computing saddle points with applications for decomposing convex programming problems. Applied Mathematics and Optimization 13 (1985), 79–95.
2. Durier, R.: On locally polyhedral convex functions. Working Paper, Université de Dijon (1986).
3. Durier, R. and Michelot, C.: Geometrical properties of the Fermat-Weber problem. European J. Oper. Res. (1985), 332–343.
4. Durier, R. and Michelot, C.: Sets of efficient points in a normed space. Journal of Mathematical Analysis and Applications 116 (1986).
5. Eckhardt, U.: Theorems on the dimension of convex sets. Linear Algebra and its Applications 12 (1975), 63–76.