查詢結果分析
來源資料
頁籤選單縮合
題 名 | A Recurrence Method for Simple Continuous Linear Programming Problems=以遞迴方法求解連續型的線性規劃問題 |
---|---|
作 者 | 溫慶豐; 吳炎崑; 盧永毅; | 書刊名 | 工業工程學刊 |
卷 期 | 26:2 2009.03[民98.03] |
頁 次 | 頁147-155 |
分類號 | 494.54 |
關鍵詞 | 連續型線性規劃問題; 遞迴方法; Continuous linear programming problems; Recurrence method; |
語 文 | 英文(English) |
中文摘要 | 本文主要探討一種特殊情況下的連續型線性規劃問題,簡稱爲(SP)問題。針對此一問題,本文提出一種有效率的方法來找尋(SP)問題的近似最佳解及近似最佳值,此法只需要利用遞迴關係求解一個有限維的線性規劃問題,即可找出原問題的近似最佳解及近似最佳值。本文就(SP)問題的求解程序提出一個演算法,此演算法不僅能容易的求解(SP)問題,並能估算近似值的誤差。最後列舉例子來證實本文所提演算法的可行性。 |
英文摘要 | In this paper, we discuss a special class of continuous linear programming problems which can be called simple continuous linear programming problems (SP). A practical and efficient method for finding an approximate optimal value and optimal solution of (SP) is presented. The main work of computing an approximate optimal value in the provided method is only to solve finite linear programming problems by using recurrence relations. Furthermore, a simple algorithm can be employed not only to easily solve the (SP) problem but also to provide an error bound of optimal value as well. Some numerical examples are given to implement the algorithm. |
本系統中英文摘要資訊取自各篇刊載內容。