Nonadjacent extreme point methods for solving linear programs

DOI10.1002/NAV.3800300111zbMATH Open0522.90057OpenAlexW2047184793MaRDI QIDQ3673477FDOQ3673477

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

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• The simplex algorithm with the pivot rule of maximizing criterion improvement
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (10)

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

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)