English  |  正體中文  |  简体中文  |  Post-Print筆數 : 27 |  Items with full text/Total items : 92604/122928 (75%)
Visitors : 26806958      Online Users : 437
RC Version 6.0 © Powered By DSPACE, MIT. Enhanced by NTU Library IR team.
Scope Tips:
  • please add "double quotation mark" for query phrases to get precise results
  • please goto advance search for comprehansive author search
  • Adv. Search
    HomeLoginUploadHelpAboutAdminister Goto mobile version
    政大機構典藏 > 商學院 > 資訊管理學系 > 期刊論文 >  Item 140.119/27351
    Please use this identifier to cite or link to this item: http://nccur.lib.nccu.edu.tw/handle/140.119/27351

    Title: An Efficient Search Direction for Linear Programming Problems
    Authors: 蔡瑞煌;陸行
    Keywords: Linear programming;Interior-point-based solution
    Date: 2002-02
    Issue Date: 2009-01-17 16:34:22 (UTC+8)
    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%.
    Relation: Computer & Operations Research, 29(2), 195-203
    Data Type: article
    Appears in Collections:[資訊管理學系] 期刊論文

    Files in This Item:

    File SizeFormat
    04.pdf99KbAdobe PDF2018View/Open

    All items in 政大典藏 are protected by copyright, with all rights reserved.

    社群 sharing

    DSpace Software Copyright © 2002-2004  MIT &  Hewlett-Packard  /   Enhanced by   NTU Library IR team Copyright ©   - Feedback