Simplex

The Simplex Algorith is a method devised by George B. Dantzig back in 1947, which since have revolutionized the way of solving linear programming problems.

George B. Dantzig received the National Medal of Science from the President of the United States “for inventing Linear Programming and for discovering the Simplex Algorithm that led to wide-scale scientific and technical applications to important problems in logistics, scheduling, and network optimization, and to the use of computers in making efficient use of the mathematical theory”. He is world famous for his twin discoveries; linear programming and the Simplex Algorithm, which together have enabled mankind for the first time to structure and solve extremely complex optimal allocation and resource problems.

Among his other discoveries are the Decomposition Principle (with Philip Wolfe) which makes it possible to decompose and solve extremely large linear programs having special structures, and applications of these techniques with sampling to solving pratical problems subject to uncertainty (Decomposition is not covered in this package).

Download is available soon.