Based upon the conjugate gradient projection algorithm of nonlinear programming

a new general method-GCG was constructed with two treatments according to the peculiarity of chemical equilibria calculation. The first treatment was that a special relation between iteration and linear searching was set up

according to the ideality of the system. The second was that a method of determining the initial active set in algorithm was designed for equilibria problems. The results of calculation showed that for most non-ideal systems

it was very efficient.