It introduces data sort algorithm and process for sorting and optimizing of The Sour Rolling Mill nerve network model, and importantly analyse Simplex and its application on sample data sort.
This paper presents an improved (infeasible) simplex method for linear programming, in which some of vertex points, corresponding to the iterative process, can be out of the feasible domain of (LP).