政大機構典藏-National Chengchi University Institutional Repository(NCCUR):Item 140.119/79649
English  |  正體中文  |  简体中文  |  Post-Print筆數 : 27 |  全文筆數/總筆數 : 114396/145431 (79%)
造訪人次 : 53067060      線上人數 : 881
RC Version 6.0 © Powered By DSPACE, MIT. Enhanced by NTU Library IR team.
搜尋範圍 查詢小技巧：
  • 您可在西文檢索詞彙前後加上"雙引號"，以獲取較精準的檢索結果
  • 若欲以作者姓名搜尋，建議至進階搜尋限定作者欄位，可獲得較完整資料
    •  進階搜尋
    政大機構典藏 > 理學院 > 應用數學系 > 期刊論文 >  Item 140.119/79649


    請使用永久網址來引用或連結此文件: https://nccur.lib.nccu.edu.tw/handle/140.119/79649


    題名: GPM ANALYSIS IN COMBINING INTERIOR POINTS AND THE SIMPLEX METHOD
    作者: Luh, Hsing
    陸行
    Chuang, Wen-Hua
    貢獻者: 應數系
    關鍵詞: linear programming, gradient projection method, QR factorization, the simplex method, interior-point algorithms
    日期: 2002
    上傳時間: 2015-12-14 17:33:40 (UTC+8)
    摘要: By geometric viewpoint in search directions of linear programming problems (LP), there are two major approaches: the simplex method and the interior-point algorithm originated from Karmarkar`s approach. Many of their variants developed both in theory and applications are still in progress. Roughly speaking, the main difference among them is that the simplex method is devoted for each the exact optimal solution while Karmarkar-based method is computationally fast in approaching to the neighborhood of the optimal solution, but it becomes slow near the optimal point. By the separating hyperplane theorem, we know that the optimal solution of a linear programming problem would locate at the boundary point. However, Karmarkar`s algorithm is claimed as an interior-point approach which takes a solution trajectory path through the interior of the feasible region. On the other hand, these algorithms will coincide the zig-zag situation following the trajectory path before attaining the optimal point meanwhile it cannot achieve the optimal point. Therefore, the purpose of this paper is to study a possible approach by combining the interior point and the simplex method. By means of QR factorization, we give a general analysis on Gradient Projection Method(GPM) in solving linear programming problems. Moreover, we prove that a general assumption-technique constraint matrix A of full rank can be relaxed by using our approach. Finally, we analyze the complexity of this approach to ensure that its upper bound is O(n3).
    關聯: Journal of the Chinese Institute of Industrial Engineers, Volume 19, Issue 4, pages 25-38
    資料類型: article
    DOI 連結: http://dx.doi.org/10.1080/10170660209509210
    DOI: 10.1080/10170660209509210
    顯示於類別:[應用數學系] 期刊論文

    文件中的檔案:

    檔案 描述 大小格式瀏覽次數
    index.html0KbHTML2934檢視/開啟


    在政大典藏中所有的資料項目都受到原著作權保護.


    社群 sharing

    著作權政策宣告 Copyright Announcement
    1.本網站之數位內容為國立政治大學所收錄之機構典藏，無償提供學術研究與公眾教育等公益性使用，惟仍請適度，合理使用本網站之內容，以尊重著作權人之權益。商業上之利用，則請先取得著作權人之授權。
    The digital content of this website is part of National Chengchi University Institutional Repository. It provides free access to academic research and public education for non-commercial use. Please utilize it in a proper and reasonable manner and respect the rights of copyright owners. For commercial use, please obtain authorization from the copyright owner in advance.

    2.本網站之製作，已盡力防止侵害著作權人之權益，如仍發現本網站之數位內容有侵害著作權人權益情事者，請權利人通知本網站維護人員(nccur@nccu.edu.tw)，維護人員將立即採取移除該數位著作等補救措施。
    NCCU Institutional Repository is made to protect the interests of copyright owners. If you believe that any material on the website infringes copyright, please contact our staff(nccur@nccu.edu.tw). We will remove the work from the repository and investigate your claim.
    DSpace Software Copyright © 2002-2004  MIT &  Hewlett-Packard  /   Enhanced by   NTU Library IR team Copyright ©   - 回饋