| dc.creator (作者) | 蔡瑞煌;陸行 | zh_TW |
| dc.creator (作者) | Tsaih,Rua-Huan | - |
| dc.date (日期) | 2002-02 | en_US |
| dc.date.accessioned | 17-Jan-2009 16:34:22 (UTC+8) | - |
| dc.date.available | 17-Jan-2009 16:34:22 (UTC+8) | - |
| dc.date.issued (上傳時間) | 17-Jan-2009 16:34:22 (UTC+8) | - |
| dc.identifier.uri (URI) | https://nccur.lib.nccu.edu.tw/handle/140.119/27351 | - |
| dc.description.abstract (摘要) | In this paper, we present an auxiliary algorithm, in terms of the speed of obtaining the optimal solution, that is effective in helping the simplex method for commencing a better initial basic feasible solution. The idea of choosing a direction towards an optimal point presented in this paper is new and easily implemented. From our experiments, the algorithm will release a corner point of the feasible region within few iterative steps, independent of the starting point. The computational results show that after the auxiliary algorithm is adopted as phase I process, the simplex method consistently reduce the number of required iterations by about 40%. | - |
| dc.format | application/ | en_US |
| dc.language | en | en_US |
| dc.language | en-US | en_US |
| dc.language.iso | en_US | - |
| dc.relation (關聯) | Computer & Operations Research, 29(2), 195-203 | en_US |
| dc.subject (關鍵詞) | Linear programming; Interior-point-based solution | - |
| dc.title (題名) | An Efficient Search Direction for Linear Programming Problems | en_US |
| dc.type (資料類型) | article | en |
