Welcome to Science4All

My name is Lê and I believe that the greatest challenge in education is to make science and math appealing.
This is why I aim at bringing enthusiasm and excitement to the readers’ learning experience.
I now run a Robustly Beneficial wiki, mostly on AI ethics, which has come to fascinate me!

Check my articles
Primal and Dual Simplex Methods Primal and Dual Simplex Methods
By Lê Nguyên Hoang | Updated:2016-02 | Prerequisites: Optimization by Linear Programming, Duality in Linear Programming | Views: 26801
The simplex method is one of the major algorithm of the 20th century, as it enables the resolution of linear problems with millions of variables. An intuitive approach is given. But that's not all. We present an important variant called the dual simplex. Finally, we'll explain its main default, that is, when facing degeneracy.