A carregar...
Publicação
A primal-dual simplex algorithm for bi-objective network flow problems
| Nome: | Descrição: | Tamanho: | Formato: | |
|---|---|---|---|---|
| In this paper we develop a primal–dual simplex algorithm for the bi-objective linear minimum cost network flow problem. This algorithm improves the general primal–dual simplex algorithm for multi-objective linear programs by Ehrgott et al. (J Optim Theory Appl 134:483–497, 2007). We illustrate the algorithm with an example and provide numerical results. | 381.91 KB | Adobe PDF |
Orientador(es)
Resumo(s)
In this paper we develop a primal–dual simplex algorithm for the bi-objective linear minimum cost network flow problem. This algorithm improves the general primal–dual simplex algorithm for multi-objective linear programs by Ehrgott et al. (J Optim Theory Appl 134:483–497, 2007). We illustrate the algorithm with an example and provide numerical results.
Descrição
MSC classification (2000) 90C29 · 90C35
Palavras-chave
Multi-criteria optimization Multi-objective linear programming Network flow problem Primal–dual simplex algorithm
Contexto Educativo
Citação
Eusébio, A., Figueira, J.R. & Ehrgott, M. A primal–dual simplex algorithm for bi-objective network flow problems. 4OR-Q J Oper Res 7, 255–273 (2009). https://doi.org/10.1007/s10288-008-0087-3
Editora
Springer