A simplex-like method with bisection for linear programming1

DOI10.1080/02331939108843714MaRDI QIDQ3979523zbMATH OpenOpenAlexFDO

Authors 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

pivot operationsimplex method

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 910295
• The generalized simplex method
• scientific article; zbMATH DE number 1504438
• An experimental investigation of a new multiplex method for linear programming
• Classical simplex methods for linear programming and their developments

Cites work

• A class of linear programming problems requiring a large number of iterations
• A suggested computation for maximal multi-commodity network flows
• Bigradients and the Euclid-Sturm Algorithm
• scientific article; zbMATH DE number 3961334 (Why is no real title available?)
• scientific article; zbMATH DE number 4089320 (Why is no real title available?)
• scientific article; zbMATH DE number 3177183 (Why is no real title available?)
• scientific article; zbMATH DE number 3477343 (Why is no real title available?)
• scientific article; zbMATH DE number 3206575 (Why is no real title available?)
• New Finite Pivoting Rules for the Simplex Method
• Optimality and Degeneracy in Linear Programming
• Practical finite pivoting rules for the simplex method
• Some Applications of the Pseudoinverse of a Matrix

Cited in

(15)

• A dual projective simplex method for linear programming
• A phase-1 approach for the generalized simplex algorithm
• A basis-defiency-allowing variation of the simplex method for linear programming
• A note on two direct methods in linear programming
• A projective simplex algorithm using LU decomposition
• A variant of the dual face algorithm using Gauss-Jordan elimination for linear programming
• An affine-scaling pivot algorithm for linear programming
• A regularized simplex method
• Markov decision processes for infinite horizon problems solved with the cosine simplex method
• A Variant of the Dual Pivoting Rule in Linear Programming
• scientific article; zbMATH DE number 1504438 (Why is no real title available?)
• scientific article; zbMATH DE number 1782200 (Why is no real title available?)
• A comprehensive simplex-like algorithm for network optimization and perturbation analysis
• scientific article; zbMATH DE number 910295 (Why is no real title available?)
• Constraint optimal selection techniques (COSTs) for nonnegative linear programming problems

This page was built for publication: A simplex-like method with bisection for linear programming¹

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