Using Cholesky factorization, the dual face algorithm was described forsolving standard Linear programming (LP) problems, as it would not be very suitablefor sparse computations. To dodge this drawback, this paper pre...Using Cholesky factorization, the dual face algorithm was described forsolving standard Linear programming (LP) problems, as it would not be very suitablefor sparse computations. To dodge this drawback, this paper presents a variant usingGauss-Jordan elimination for solving bounded-variable LP problems.展开更多
基金the National Natural Science Foundation of China(Nos.10871043 and 70971136).
文摘Using Cholesky factorization, the dual face algorithm was described forsolving standard Linear programming (LP) problems, as it would not be very suitablefor sparse computations. To dodge this drawback, this paper presents a variant usingGauss-Jordan elimination for solving bounded-variable LP problems.
