Relaxed Dual simplex Approach for Bounded Variable Linear programs

DOI10.1080/02522667.1983.10698764zbMath0527.90065OpenAlexW2056544346MaRDI QIDQ3042869

No author found.

Publication date: 1983

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

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

zbMATH Keywords

algorithmdual simplex algorithmbounded variable linear programs

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Upper Bounds, Secondary Constraints, and Block Triangularity in Linear Programming
• Handling Artificial Variables in Simplex Method

This page was built for publication: Relaxed Dual simplex Approach for Bounded Variable Linear programs