查詢結果分析
來源資料
相關文獻
- The Cosine Simplex Algorithm
- A Simple Algorithm to Search for All d-MCs
- 以灰色線性規劃為基礎之重新調度法作動態發電分配
- Minimum-Torque Trajectory Planning of Redundant Manipulators between Two Joint Configurations
- A Novel Track Accessing Servo Design for a Dual Actuator System
- 以資料包絡法評量我國大學校院之教育品質
- 架構電腦整合生產管理系統的二階段模糊規劃模型
- 模糊線性規劃於水資源規劃之應用
- 水庫標的線性規劃問題之網路切割法簡介
- Revised Simplex Method在電腦飼料配方上之應用
頁籤選單縮合
題名 | The Cosine Simplex Algorithm=餘弦簡算法 |
---|---|
作者姓名(中文) | 葉維彰; | 書刊名 | 逢甲學報 |
卷期 | 36 1999.12[民88.12] |
頁次 | 頁37-42 |
分類號 | 440.11 |
關鍵詞 | 限制性最佳化問題; 線性規劃; 簡算法; 餘弦啟發法則; Constrained optimization; Linear programming; Simplex method; Cosine heuristic; |
語文 | 英文(English) |
中文摘要 | 線性規劃係限制性最佳化問題之核心模式,而簡算法更為解決線性規劃問題的一 個重要方法之一。雖然簡算法其演算複雜度為一指數函數,然卻非常適合用於探討最佳化分 析。藉由解決一連串的子線性規劃問題,直到原線性規劃問題被解出為止的新演算法將於本 研究中被提出。於此延伸簡算法中,根據本文所發展之餘弦啟發法則,每一子線性規劃問題加 上一限制條件而得另一子問題,所得之結果,顯示本演算法優於原簡算法。 |
英文摘要 | Linear programming is the core model of constrained optimization; and the simplex method is one of the most significant method for the routine use of linear programming. It is ideally suited for post-optimality analysis, although with exponential time complexity. An extension of the simplex algorithm is presented in which a sequence of subsidiary linear programming problems is solved until a solution to the original problem is reached. Each successive subsidiary problem is obtained from the previous one by adding one constraint at a time according to a certain cosine heuristic. Preliminary results for small problems are encouraging. |
本系統之摘要資訊系依該期刊論文摘要之資訊為主。