A generalized dual phase-2 simplex algorithm.

DOI10.1016/S0377-2217(02)00448-4MaRDI QIDQ1811141zbMATH OpenFDO

Authors István Maros

Publication date 10 June 2003

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

Full work available at URL http://hdl.handle.net/10044/1/95756

zbMATH Keywords

Dual algorithmLarge scale optimizationLinear programmingSimplex method

Mathematics Subject Classification ID

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

Recommendations

• A piecewise linear dual phase-1 algorithm for the simplex method
• Progress in the dual simplex method for large scale LP problems: Practical dual phase 1 algorithms
• Investigating phase 1 of the dual simplex
• The dual simplex method, techniques for a fast and stable implementation
• A primal-dual simplex method for linear programs

Cites work

• A general phase-I method in linear programming
• scientific article; zbMATH DE number 1187125 (Why is no real title available?)
• scientific article; zbMATH DE number 3497901 (Why is no real title available?)
• scientific article; zbMATH DE number 3209723 (Why is no real title available?)
• scientific article; zbMATH DE number 3069632 (Why is no real title available?)
• Investigating the sparse simplex algorithm on a distributed memory multiprocessor
• Maximizing Submodular Set Functions: Formulations and Analysis of Algorithms
• MIP: Theory and practice -- closing the gap
• The Composite Simplex Algorithm

Cited in

(29)

• Progress in the dual simplex algorithm for solving large scale LP problems: Techniques for a fast and stable implementation
• A solution comparison for dual angular linear programs
• A dual projective simplex method for linear programming
• The long step rule in the bounded-variable dual simplex method: Numerical experiments
• A piecewise linear dual phase-1 algorithm for the simplex method
• A phase-1 approach for the generalized simplex algorithm
• An exploratory computational analysis of dual degeneracy in mixed-integer programming
• Solving two-stage stochastic programming problems with level decomposition
• Progress in the dual simplex method for large scale LP problems: Practical dual phase 1 algorithms
• scientific article; zbMATH DE number 3856816 (Why is no real title available?)
• The positive edge pricing rule for the dual simplex
• Investigating phase 1 of the dual simplex
• A flexible platform for mixed-integer non-linear programming problems
• The dual simplex method, techniques for a fast and stable implementation
• A deficient-basis dual counterpart of Paparrizos, Samaras and Stephanides’ primal-dual simplex-type algorithm†
• Métodos tipo dual simplex para problemas de otimização linear canalizados e esparsos
• Scalability of the genetic hybrid algorithm on a parallel supercomputer
• Implementing the simplex method as a cutting-plane method, with a view to regularization
• scientific article; zbMATH DE number 1187125 (Why is no real title available?)
• Dual simplex algorithm with implicit representation of variable upper bounds
• Concurrent processing of mixed-integer non-linear programming problems
• Concurrent processing of heteroskedastic vector-valued mixture density models
• scientific article; zbMATH DE number 232263 (Why is no real title available?)
• A practical guide to the dual theorem
• On the Use of Duality and Pricing Criteria in the Generalized‐simplex Method
• The double pivot simplex method
• A primal-dual simplex method for linear programs
• Dual simplex method for GUB problems
• Computational study of the GDPO dual phase-1 algorithm

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1811141)