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...
Na minha lista:
| Principais autores: | , , |
|---|---|
| Formato: | Artigo |
| Idioma: | Inglês |
| Publicado em: |
Wiley
2014-01-01
|
| Colecção: | Journal of Applied Mathematics |
| Acesso em linha: | http://dx.doi.org/10.1155/2014/160262 |
| Tags: |
Sem tags, seja o primeiro a adicionar uma tag!
|