Restricted vertex generation applied as a crashing procedure for linear programming

DOI10.1016/0305-0548(84)90041-8zbMATH Open0608.90063OpenAlexW2128823028MaRDI QIDQ1086152FDOQ1086152

Authors: H. P. Williams 

Publication date: 1984

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0305-0548(84)90041-8

Recommendations

• Fourier's Method of Linear Programming and Its Dual
• Modified Fourier's method of solving linear programming problems.
• A dual projective simplex method for linear programming
• Eliminating columns in the simplex method for linear programming
• A dual projective pivot algorithm for linear programming

zbMATH Keywords

Fourier-Motzkin eliminationcrashing procedurerestricted vertex generation

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?)
• A simulation study of some simplification strategies in the development of product-mix models

This page was built for publication: Restricted vertex generation applied as a crashing procedure for linear programming

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