Eliminating columns in the simplex method for linear programming

DOI10.1007/BF00940732zbMath0661.90055OpenAlexW2080197321MaRDI QIDQ1113797

Yinyu Ye

Publication date: 1989

Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf00940732

zbMATH Keywords

simplex methodpricing criterioncolumn eliminationcolumn-eliminating techniquenonbasic variablesprimal and dual methods

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Linear programming (90C05)

Related Items (2)

A triangulation and fill-reducing initialization procedure for the simplex algorithm ⋮ Admission control strategies for tandem Markovian loss systems

Cites Work

• Unnamed Item
• Unnamed Item
• A new polynomial-time algorithm for linear programming
• A ``build-down scheme for linear programming
• Karmarkar's algorithm and the ellipsoid method
• Identifying Redundant Constraints and Implicit Equalities in Systems of Linear Constraints
• Improved Bounds and Containing Ellipsoids in Karmarkar's Linear Programming Algorithm
• New criteria for the simplex algorithm
• Generalized theorems for permanent basic and nonbasic variables

This page was built for publication: Eliminating columns in the simplex method for linear programming