Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.author | 오정은 | - |
dc.creator | 오정은 | - |
dc.date.accessioned | 2016-08-26T02:08:21Z | - |
dc.date.available | 2016-08-26T02:08:21Z | - |
dc.date.issued | 1999 | - |
dc.identifier.other | OAK-000000001620 | - |
dc.identifier.uri | https://dspace.ewha.ac.kr/handle/2015.oak/193037 | - |
dc.identifier.uri | http://dcollection.ewha.ac.kr/jsp/common/DcLoOrgPer.jsp?sItemId=000000001620 | - |
dc.description.abstract | Interior point method(IPM) 의 전반적인 발달과정을 살펴보고 IPM의 한 방법인 infeasible-primal-dual algorithm언급한다. 이 방법을 이용한 package인 LIPSOL(linear programming interior-point solvers)의 효율성을 보인다. ; The Interior point methods for linear programming have gained extraordinary interest as an alternative to the sparse simplex based methods. First we give a short overview of the Interior point methods(IPM) and then present the infeasible-primal-dual algorithm which is widely considered the most efficient general purpose IPM. And we descrie the software which is called LIPSOL-linear programming interior-point SOLvers¹. Our final aim is to interpret and deal with the solutions of problems²solved by it, and demonstrate author s assertion of its efficiency when dealing with the large scale and spars problems. ¹ by Yin Zhang, Department of Computational Appied Mathematics, Rice University ² obtained in NETLIB and sztaki.hu\pub\oplab\LPTESTSET | - |
dc.description.tableofcontents | Abstract = ⅱ 1. Introduction = 1 2. The infeasible-Primal-Dual algorithm = 3 2.1 Linear Programming = 3 2.2 Newton s Method = 6 2.3 Infeasible-Point Methods = 7 3. Lipsol-linear Programming Interior Point Solvers = 11 3.1 Input Formats = 11 3.2 Algorithm = 13 4. Numerical Results = 15 4.1 Problems = 15 4.1.1 Netlib Problem = 15 4.1.2 Problematic Problem = 16 4.2 Concluding Remarks = 20 References | - |
dc.format | application/pdf | - |
dc.format.extent | 985197 bytes | - |
dc.language | eng | - |
dc.publisher | 이화여자대학교 대학원 | - |
dc.title | Numerical efficiency tests on interior point methods in LIPSOL (linear programming interior-point SOLvers) | - |
dc.type | Master's Thesis | - |
dc.identifier.thesisdegree | Master | - |
dc.identifier.major | 대학원 수학과 | - |
dc.date.awarded | 1999. 2 | - |