A simplex-like method with bisection for linear programming1

DOI10.1080/02331939108843714zbMath0739.90043OpenAlexW1972857658MaRDI QIDQ3979523

Ping-Qi Pan

Publication date: 26 June 1992

Published in: Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/02331939108843714

zbMATH Keywords

simplex methodpivot operation

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Linear programming (90C05) Computational methods for problems pertaining to operations research and mathematical programming (90-08)

Related Items

A phase-1 approach for the generalized simplex algorithm, Markov decision processes for infinite horizon problems solved with the cosine simplex method, A dual projective simplex method for linear programming, A Variant of the Dual Pivoting Rule in Linear Programming, Constraint optimal selection techniques (COSTs) for nonnegative linear programming problems, A projective simplex algorithm using LU decomposition, A variant of the dual face algorithm using Gauss-Jordan elimination for linear programming, A basis-defiency-allowing variation of the simplex method for linear programming, A note on two direct methods in linear programming, An affine-scaling pivot algorithm for linear programming, A comprehensive simplex-like algorithm for network optimization and perturbation analysis

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Practical finite pivoting rules for the simplex method
• A class of linear programming problems requiring a large number of iterations
• A Suggested Computation for Maximal Multi-Commodity Network Flows
• New Finite Pivoting Rules for the Simplex Method
• Some Applications of the Pseudoinverse of a Matrix
• Bigradients and the Euclid-Sturm Algorithm
• Optimality and Degeneracy in Linear Programming