A generalized dual phase-2 simplex algorithm.

DOI10.1016/S0377-2217(02)00448-4zbMath1035.90040MaRDI QIDQ1811141

István Maros

Publication date: 10 June 2003

Published in: European Journal of Operational Research (Search for Journal in Brave)

zbMATH Keywords

Linear programmingLarge scale optimizationSimplex methodDual algorithm

Mathematics Subject Classification ID

Large-scale problems in mathematical programming (90C06) Linear programming (90C05) Extreme-point and pivoting methods (90C49)

Related Items (10)

Progress in the dual simplex method for large scale LP problems: Practical dual phase 1 algorithms ⋮ The positive edge pricing rule for the dual simplex ⋮ Implementing the simplex method as a cutting-plane method, with a view to regularization ⋮ Concurrent processing of heteroskedastic vector-valued mixture density models ⋮ Solving two-stage stochastic programming problems with level decomposition ⋮ A flexible platform for mixed‐integer non‐linear programming problems ⋮ Concurrent processing of mixed‐integer non‐linear programming problems ⋮ Métodos tipo dual simplex para problemas de otimização linear canalizados e esparsos ⋮ Scalability of the genetic hybrid algorithm on a parallel supercomputer ⋮ Progress in the dual simplex algorithm for solving large scale LP problems: Techniques for a fast and stable implementation

Cites Work

• A general phase-I method in linear programming
• Investigating the sparse simplex algorithm on a distributed memory multiprocessor
• Maximizing Submodular Set Functions: Formulations and Analysis of Algorithms
• The Composite Simplex Algorithm
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A generalized dual phase-2 simplex algorithm.