1. M. Balinski, “An algorithm for finding all vertices of a convex polyhedral set”,SIAM Journal 9 (1) (1961) 72–88.
2. C.A. Burdet, “Deux modèles de minimisation d'une fonction économique concave”, R.I.R.O. No. V-1-1970 (1970) 79–84.
3. A.V. Cabot, “Variations on a cutting plane method for solving concave minimization problems with linear constraints”, Indiana University (1972).
4. J.M. Danskin,The theory of max—min (Springer, Berlin, 1967).
5. H. Konno, “Bilinear programming: Part I. Algorithm for solving bilinear programs”, Technical Report No. 71-9, Operations Research House, Stanford, Calif. (1971).