Métodos tipo dual simplex para problemas de otimização linear canalizados e esparsos

DOI10.1590/S0101-74382007000300004zbMath1176.90401OpenAlexW1967718819MaRDI QIDQ3621498

Ricardo Silveira Sousa, Carla Taviane Lucke da Silva, Marcos Nereu Arenales

Publication date: 21 April 2009

Published in: Pesquisa Operacional (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1590/s0101-74382007000300004

zbMATH Keywords

dualitylinear optimizationsparsitypiecewise linear optimization

Mathematics Subject Classification ID

Linear programming (90C05)

Related Items (1)

Efficient approaches for the flooding problem on graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A generalized dual phase-2 simplex algorithm.
• A stabilization of the simplex method
• The Elimination form of the Inverse and its Application to Linear Programming
• A sparsity-exploiting variant of the Bartels—Golub decomposition for linear programming bases
• Computing Sparse LU Factorizations for Large-Scale Linear Programming Bases
• The simplex method of linear programming using LU decomposition

This page was built for publication: Métodos tipo dual simplex para problemas de otimização linear canalizados e esparsos