Dual simplex algorithm with implicit representation of variable upper bounds

DOI10.1080/02331939508844084zbMATH Open0821.90081OpenAlexW1968609804MaRDI QIDQ4836772FDOQ4836772

Authors: W. 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

Recommendations

• An Implementation of Variable Upper Bounds via SUB Methodology
• scientific article; zbMATH DE number 522740
• Implicit representation of generalized variable upper bounds using the elimination form of the inverse on secondary storage
• A generalized dual phase-2 simplex algorithm.
• A practical guide to the dual theorem

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

• Title not available (Why is that?)
• An implementation of the simplex method for linear programming problems with variable upper bounds
• Title not available (Why is that?)
• Implicit representation of generalized variable upper bounds in linear programming
• A solver for the multi-objective transshipment problem with facility location
• Title not available (Why is that?)
• Compact LP bases for a class of IP problems

Cited In (3)

• Implicit representation of generalized variable upper bounds using the elimination form of the inverse on secondary storage
• Title not available (Why is that?)
• Dual simplex method for GUB problems

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

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