Computational tricks in linear programming without the use of artificial variables

摘要

We describe two computational tricks without the use of artificial variables, conerning the solution of the problem cTx-min, Ax=P0,x>0. where c=(c1,c2...,cn)T,x=(1,2,...n)T, A is a matrix of the dimentsion m+n with the rank m.