An Implementation of Variable Upper Bounds via SUB Methodology

DOI10.1080/02522667.1992.10699091MaRDI QIDQ4008468zbMATH OpenOpenAlexFDO

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

implementation techniquessimplex methodvariable upper bounds

Mathematics Subject Classification ID

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

Recommendations

• An enhanced formulation of error bound in subspace iteration method
• Determination of inner and outer bounds of reachable sets through subpavings
• scientific article; zbMATH DE number 922624
• Subset complement addition upper bounds. An improved inclusion-exclusion method
• Implicit representation of generalized variable upper bounds using the elimination form of the inverse on secondary storage
• A nonlinear programming method approach for upper bound limit analysis
• Guaranteed set computation with subpavings
• A method for solving some optimization problems with bounds on variables
• A branch bound method for subset sum problem

Cites work

• 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
• scientific article; zbMATH DE number 3809325 (Why is no real title available?)
• scientific article; zbMATH DE number 4049374 (Why is no real title available?)
• scientific article; zbMATH DE number 3561083 (Why is no real title available?)
• Implicit representation of generalized variable upper bounds in linear programming
• The Composite Simplex Algorithm
• The simplex SON algorithm for LP/embedded network problems

Cited in

(2)

• Dual simplex algorithm with implicit representation of variable upper bounds
• Implicit representation of generalized variable upper bounds using the elimination form of the inverse on secondary storage

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

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