Nonadjacent extreme point methods for solving linear programs

DOI10.1002/NAV.3800300111MaRDI QIDQ3673477zbMATH OpenOpenAlexFDO

Authors Hanif D. Sherali, Stafford G. Baines, Allen L. Soyster

Publication date 1983

Published in Naval Research Logistics Quarterly (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1002/nav.3800300111

zbMATH Keywords

relaxation methodoptimal basisreduced gradient methodfeasible directions methodrandomly generated test problemsdual linear programsblock pivotingadvanced basisbinding hyperplanesnonadjacent extreme point methodsnumerical comparison of algorithmstwo phase simplex method

Mathematics Subject Classification ID

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

Cites work

• scientific article; zbMATH DE number 3137857 (Why is no real title available?)
• scientific article; zbMATH DE number 3561084 (Why is no real title available?)
• scientific article; zbMATH DE number 3612766 (Why is no real title available?)
• scientific article; zbMATH DE number 3614492 (Why is no real title available?)
• scientific article; zbMATH DE number 2166303 (Why is no real title available?)
• scientific article; zbMATH DE number 3354790 (Why is no real title available?)
• The simplex algorithm with the pivot rule of maximizing criterion improvement

Cited in

(10)

• A computational study of redundancy in randomly generated polytopes
• Adjacent vertex simplex algorithms: More experimental results on random problems
• Experiments with external pivoting
• Solving large-scale linear programs by aggregation
• The sagitta method for solving linear programs
• A feasible direction method for linear programming
• A two-phase support method for solving linear programs: numerical experiments
• An external reconstruction approach (ERA) to linear programming
• Intelligent gradient search in linear programming
• LPAKO: A Simplex-based Linear Programming Program

Describes a project that uses

Uses Software

• DEVEX

This page was built for publication: Nonadjacent extreme point methods for solving linear programs

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