(A) non-edge-following method for linear programming problems線型計劃法을 위한 非頂變形解法
| DC Field | Value | Language |
|---|---|---|
| dc.contributor.advisor | Ahn, Byong-Hun | - |
| dc.contributor.advisor | 안병훈 | - |
| dc.contributor.author | Baek, Seung-Gyu | - |
| dc.contributor.author | 백승규 | - |
| dc.date.accessioned | 2011-12-14T06:00:45Z | - |
| dc.date.available | 2011-12-14T06:00:45Z | - |
| dc.date.issued | 1982 | - |
| dc.identifier.uri | http://library.kaist.ac.kr/search/detail/view.do?bibCtrlNo=63521&flag=dissertation | - |
| dc.identifier.uri | http://hdl.handle.net/10203/44605 | - |
| dc.description | 학위논문(석사) - 한국과학기술원 : 경영과학과, 1982.2, [ [ii], 41, [2] p. ] | - |
| dc.description.abstract | This thesis presents a non edge-following algorithm for solving linear programming problems. Unlike simplex algorithm, this algorithm requires as its initial solution a dual feasible solution which is not necessarily a basic solution. Convergence condition of this algorithm is investigated. Perturbation method as a resolution of cycling is developed. Results of test runs with 25 randomly generated problems are presented. | eng |
| dc.language | eng | - |
| dc.publisher | 한국과학기술원 | - |
| dc.title | (A) non-edge-following method for linear programming problems | - |
| dc.title.alternative | 線型計劃法을 위한 非頂變形解法 | - |
| dc.type | Thesis(Master) | - |
| dc.identifier.CNRN | 63521/325007 | - |
| dc.description.department | 한국과학기술원 : 경영과학과, | - |
| dc.identifier.uid | 000801121 | - |
| dc.contributor.localauthor | Ahn, Byong-Hun | - |
| dc.contributor.localauthor | 안병훈 | - |
- Appears in Collection
- MG-Theses_Master(석사논문)
- Files in This Item
- There are no files associated with this item.
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.