ZX algorithm and its application in computer-aided management engineering

In network planning of management engineering, when carrying out the analysis of minimum cost, we often encounter a class of linear programming problem whose variables have upper limit. To solve this kind of problem the commonly used method is to use the modified simplex method. But with this method a great deal of computer memory space has to be used. In order to overcome this disadvantage we design a ZX algorithm. It can eliminate the upper-bound condition and enable the occupation of computer memory space to be decreased considerably. So this method can raise the efficiency of problem-solving greatly for computer.