The formal similarity between von Neumann's theorem on maximal growth and (a weak form of) the fundamental theorem of linear programming is striking. The parallelism is explained by considering a simple economy for which the two problems are identical

This work aims to provide a representation theorem for consumption in simplex in continuous time by using a weaker axiom of ’Agree with’, a strong axiom of ’Preferential Independence’,[10, 9], and axioms of ’Separability’ and ’Measurability’ on Simplex provided by Qin and...

Around 1947, von Neumann showed that for any finite two-person zero-sum game, there is a feasible linear programming (LP) problem consisting of a primal-dual pair of linear programs whose saddle points yield equilibria of the game, thus providing an immediate proof of the minimax theorem from...