Implementation of a Double-Basis Simplex Method for the General Linear Programming Problem

DOI10.1137/0606056zbMath0575.90036OpenAlexW2013545367MaRDI QIDQ3694975

P. E. Proctor

Publication date: 1985

Published in: SIAM Journal on Algebraic Discrete Methods (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/0606056

zbMATH Keywords

simplex methodbasis handling proceduresdouble basis

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Large-scale problems in mathematical programming (90C06) Linear programming (90C05)

Uses Software

• XMP

Cites Work

• Unnamed Item
• A bump triangular dynamic factorization algorithm for the simplex method
• A set of staircase linear programming test problems
• A Lagrangean Relaxation Algorithm for the Two Duty Period Scheduling Problem
• Matrix augmentation and partitioning in the updating of the basis inverse
• A TWO-LEVEL ALGORITHM FOR TWO-STAGE LINEAR PROGRAMS
• A Spike Collective Dynamic Factorization Algorithm for the Simplex Method
• Upper Bounds, Secondary Constraints, and Block Triangularity in Linear Programming

This page was built for publication: Implementation of a Double-Basis Simplex Method for the General Linear Programming Problem