This paper has always been one of my favorite “children,” combining as it does elements of the duality of linear programming and combinatorial tools from graph theory. It may be of some interest to… Expand

This paper has always been one of my favorite “children,” combining as it does elements of the duality of linear programming and combinatorial tools from graph theory. It may be of some interest to… Expand

This note calls attention to the work of Weiszfeld in 1937, who may have been the first to propose an iterative algorithm for the General Fermat Problem.Expand

This central result of this paper is a combinatorial proposition, analogous to the Sperner Lemma, and applying to the n-cube, for which subdivision is a trivial operation.Expand

A historical survey of the origins of nonlinear programming is presented, illustrated by duality theorems for nonlinear programs that antedate the modern development of the subject.Expand

Classics in Game Theory assembles in one sourcebook the basic contributions to the field that followed on the publication of Theory of Games and Economic Behavior by John von Neumann and Oskar… Expand