An Effective Branch and Bound Algorithm for Minimax Linear Fractional Programming
An effective branch and bound algorithm is proposed for globally solving minimax linear fractional programming problem (MLFP). In this algorithm, the lower bounds are computed during the branch and bound search by solving a sequence of linear relaxation programming problems (LRP) of the problem (MLF...
保存先:
| 主要な著者: | , , |
|---|---|
| フォーマット: | Artigo |
| 言語: | Inglês |
| 出版事項: |
Wiley
2014-01-01
|
| シリーズ: | Journal of Applied Mathematics |
| オンライン･アクセス: | http://dx.doi.org/10.1155/2014/160262 |
| タグ: |
タグなし, このレコードへの初めてのタグを付けませんか!
|