Dual simplex algorithm with implicit representation of variable upper bounds

DOI10.1080/02331939508844084zbMath0821.90081OpenAlexW1968609804MaRDI QIDQ4836772

Włodzimierz Ogryczak

Publication date: 21 June 1995

Published in: Optimization (Search for Journal in Brave)

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

zbMATH Keywords

dual simplex methodvariable upper bounds

Mathematics Subject Classification ID

Linear programming (90C05) Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08)

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
• Compact LP bases for a class of IP problems
• Implicit representation of generalized variable upper bounds in linear programming

This page was built for publication: Dual simplex algorithm with implicit representation of variable upper bounds