A warm-start dual simplex solution algorithm for the minimum flow networks with postoptimality analyses
From MaRDI portal
Publication:699349
DOI10.1016/S0895-7177(98)00074-0zbMath1003.90529OpenAlexW2016871718MaRDI QIDQ699349
Veena G. Adlakha, Hossein Arsham
Publication date: 24 September 2002
Published in: Mathematical and Computer Modelling (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0895-7177(98)00074-0
Related Items
A computationally stable solution algorithm for linear programs, Construction of the largest sensitivity region for general linear programs, Integer optimization by α‐dense curves, A comprehensive simplex-like algorithm for network optimization and perturbation analysis
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- New crash procedures for large systems of linear constraints
- Network flow problems with one side constraint: A comparison of three solution methods
- A dual approach to primal degeneracy
- A potential-function reduction algorithm for solving a linear program directly from an infeasible ``warm start
- On the computational behavior of a polynomial-time network flow algorithm
- A practical anti-cycling procedure for linearly constrained optimization
- Duality and admissible transformations in combinatorial optimization
- Anti-stalling pivot rules for the network simplex algorithm
- On cycling in the network simplex method
- On the simplex algorithm for networks and generalized networks
- An efficient implementation of the network simplex method
- Exact cuts in networks
- A bump triangular dynamic factorization algorithm for the simplex method
- A sparsity-exploiting variant of the Bartels—Golub decomposition for linear programming bases
- Sensitivity analysis of 0-1 multiterminal network flows
- Minimum flows in (s,t) planar networks
- Postoptimality Analyses of the Transportation Problem
- Implementing the Simplex Method: The Initial Basis
- Theoretical Properties of the Network Simplex Method
- Updated triangular factors of the basis to maintain sparsity in the product form simplex method
