내부점 선형계획법의 쌍대문제 전환에 대하여

On dual transformation in the interior point method of linear programming

  • 발행 : 1996.10.01

초록

In Cholesky factorization of the interior point method, dense columns of A matrix make dense Cholesky factor L regardless of sparsity of A matrix. We introduce a method to transform a primal problem to a dual problem in order to preserve the sparsity.

키워드