A primal-dual simplex method for linear programs

DOI10.1016/0167-6377(93)90045-IzbMath0783.90069OpenAlexW2016833203MaRDI QIDQ688212

Norman D. Curet

Publication date: 28 November 1993

Published in: Operations Research Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0167-6377(93)90045-i

zbMATH Keywords

dual ascentlarge generalized network linear programsprimal-dual simplex method

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Linear programming (90C05) Computational methods for problems pertaining to operations research and mathematical programming (90-08)

Related Items (5)

An incremental primal-dual method for generalized networks ⋮ Applying steepest-edge techniques to a network primal-dual algorithm ⋮ Constraint optimal selection techniques (COSTs) for nonnegative linear programming problems ⋮ Exterior point simplex-type algorithms for linear and network optimization problems ⋮ A new efficient primal dual simplex algorithm

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Canonical bases in linear programming
• A sequential dual simplex algorithm for the linear assignment problem
• An incremental primal-dual method for generalized networks
• Solving Generalized Networks
• Efficient dual simplex algorithms for the assignment problem
• A Family of Simplex Variants Solving an m × d Linear Program in Expected Number of Pivot Steps Depending on d Only
• Relaxation Methods for Linear Programs
• New Finite Pivoting Rules for the Simplex Method

This page was built for publication: A primal-dual simplex method for linear programs