Reordenamento Estático na Atualização da Decomposição LU no Método Simplex
Abstract
Full Text:
PDF (Português (Brasil))References
[1] R. Bartels, A stabilization of the simplex method, Numer. Math., 16 (1971), 414-434.
G. Bressan, A. Oliveira, Fast iterations for the combined cutting-stock and lot-sizing problems, Anais da IX International Conference on Industrial Enginnering and Operations Management, Arq. TI0601, (2003), 1-8.
G. Bressan, A. Oliveira, Reordenamento eficiente das colunas básicas na programa ção de lotes e cortes, Pesquisa Operacional, 4 (2004), 323-337.
I. Duff, A. Erisman, J. Reid, “Direct methods for sparse matrices”, Clarendon Press, Oxford, 1986.
J.L. Kennington, R.V. Helgason, “Algorithms for Network Programming”, Wiley, New York, 1980.
H. Markowitz, The elimination form of the inverse and its applications to linear programming, Management Science, 3 (1957), 255-269.
I. Maros, “Computational Techniques of the Simplex Method”, Kluwer Academic Publishers, 2003.
S.L. Nonas, A. Thorstenson, A combined cutting-stock and lot-sizing problem, Operations Research, 120 (2000), 327-342.
J. Reid, A sparsity-exploiting variant of the Bartels-Golub decomposition for linear programming bases, Mathematical Programming, 24 (1982), 55-69.
C.T.L. Silva, “Problemas de Otimização Linear Canalizados e Esparsos”, Dissertação de Mestrado, ICMC, USP, São Carlos, 2002.
U. Suhl, L. Suhl, A fast lu update for linear programming, Annals of Operations Research, 43 (1993), 33-47.
DOI: https://doi.org/10.5540/tema.2007.08.02.0211
Article Metrics
Metrics powered by PLOS ALM
Refbacks
- There are currently no refbacks.
Trends in Computational and Applied Mathematics
A publication of the Brazilian Society of Applied and Computational Mathematics (SBMAC)
Indexed in: