A note on Schrage's generalised variable upper bounds

DOI10.1007/BF01609039zbMATH Open0402.90058OpenAlexW1984830165MaRDI QIDQ4187573FDOQ4187573

Authors: Robert Daniel 

Publication date: 1978

Published in: Mathematical Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01609039

zbMATH Keywords

Simplex AlgorithmComputational EfficiencyLinear ProgrammingPivotingGeneralised Variable Upper Bounds

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Implicit representation of generalized variable upper bounds in linear programming

Cited In (2)

• An implementation of the simplex method for linear programming problems with variable upper bounds
• Large-scale linear programming: Geometry, working bases and factorizations

This page was built for publication: A note on Schrage's generalised variable upper bounds

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