Later, von Neumann suggested a new method of linear programming, using the homogeneous linear system of Gordan (1873), which was later popularized by Karmarkar's algorithm. Von Neumann's method used a pivoting algorithm between simplices, with the pivoting decision determined by a nonnegative least squares subproblem with a convexity constraint (projecting the zero-vector onto the convex hull of the active simplex). Von Neumann's algorithm was the first interior point method of linear programming.
వాన్ న్యూమన్ సూచించిన సరళ ప్రోగ్రామింగ్ యొక్క కొత్త పద్ధతి ఏమిటి?
homogeneous linear system of Gordan