查詢結果分析
相關文獻
頁籤選單縮合
題名 | Solving a Budget Allocation Problem Using Bi-level Linear I Programming= |
---|---|
作者 | Yang, Yeou-herng; Yu, Hsiao-cheng; Liu, Yi-hsin; |
期刊 | Academy of Taiwan Business Management Review |
出版日期 | 20090800 |
卷期 | 5:2 2009.08[民98.08] |
頁次 | 頁131-137 |
分類號 | 494.7 |
語文 | eng |
關鍵詞 | Budget allocation; Linear bilevel programming; Kth-best approach; |
英文摘要 | To formulate a mathematical budget allocation model with the bilevel objectives and constraints is a challenging problem, and to solve this type of problems is even a bigger challenge. This paper proposes a linear bilevel programming to address this problem. It is a mathematical programming model that for feasible allocation of budget. The model of budget allocation objectives include: low-level units must be maximize the overall potential contribution of projects to be funded, and upper-level decision maker will be minimizing the difference between the highest and the lowest hit rates of budget contending organizations. |
本系統之摘要資訊系依該期刊論文摘要之資訊為主。