DC Field | Value | Language |
---|---|---|
dc.contributor.author | 정성진 | ko |
dc.contributor.author | 강완모 | ko |
dc.contributor.author | 정의석 | ko |
dc.contributor.author | 허홍석 | ko |
dc.date.accessioned | 2013-02-25T22:28:13Z | - |
dc.date.available | 2013-02-25T22:28:13Z | - |
dc.date.created | 2012-02-06 | - |
dc.date.created | 2012-02-06 | - |
dc.date.created | 2012-02-06 | - |
dc.date.created | 2012-02-06 | - |
dc.date.created | 2012-02-06 | - |
dc.date.issued | 1993-11 | - |
dc.identifier.citation | 대한산업공학회지, v.19, no.4, pp.3 - 11 | - |
dc.identifier.issn | 1225-0988 | - |
dc.identifier.uri | http://hdl.handle.net/10203/65750 | - |
dc.description.abstract | We propose a new dual simplex method using a primal interior point. The dropping variable is chosen by utilizing the primal feasible interior point. For a given dual feasible basis, its corresponding primal infeasible basic vector and the interior point are used for obtaining a decreasing primal feasible point The computation time of moving on interior point in our method takes much less than that od Karmarker-type interior methods. Since any polynomial time interior methods can be applied to our method we conjectured that a slight modification of our method can give a polynomial time complexity. | - |
dc.language | Korean | - |
dc.publisher | 대한산업공학회 | - |
dc.title | 선형계획문제의 강성다항식 계산단계 기법에 관한 연구 | - |
dc.title.alternative | A Study on the Strong Polynomial Time Algorithm for the Linear Programming | - |
dc.type | Article | - |
dc.type.rims | ART | - |
dc.citation.volume | 19 | - |
dc.citation.issue | 4 | - |
dc.citation.beginningpage | 3 | - |
dc.citation.endingpage | 11 | - |
dc.citation.publicationname | 대한산업공학회지 | - |
dc.contributor.localauthor | 강완모 | - |
dc.contributor.nonIdAuthor | 정성진 | - |
dc.contributor.nonIdAuthor | 정의석 | - |
dc.contributor.nonIdAuthor | 허홍석 | - |
dc.description.isOpenAccess | N | - |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.