An Implementation of Variable Upper Bounds via SUB Methodology

DOI10.1080/02522667.1992.10699091zbMath0756.90061OpenAlexW2033494775MaRDI QIDQ4008468

Włodzimierz Ogryczak

Publication date: 27 September 1992

Published in: Journal of Information and Optimization Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/02522667.1992.10699091

zbMATH Keywords

simplex methodimplementation techniquesvariable upper bounds

Mathematics Subject Classification ID

Linear programming (90C05) Computational methods for problems pertaining to operations research and mathematical programming (90-08)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A solver for the multi-objective transshipment problem with facility location
• An implementation of the simplex method for linear programming problems with variable upper bounds
• The simplex SON algorithm for LP/embedded network problems
• Implicit representation of generalized variable upper bounds in linear programming
• The Composite Simplex Algorithm

This page was built for publication: An Implementation of Variable Upper Bounds via SUB Methodology