다변환 심플렉스 기법과 이의 효율성

A Multi-interchange Simplex Method and its Computational Efficiency

A multi-interchange simplex method is presented. This method tries to cut almost half of the set of convex combinations which generate all decreasing feasible directions. Analysis of this method indicates high possibility of the existence of polynomial-time simplex-type methods.