Relaxed Dual simplex Approach for Bounded Variable Linear programs

DOI10.1080/02522667.1983.10698764MaRDI QIDQ3042869zbMATH OpenOpenAlexFDO

Authors

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

algorithmbounded variable linear programsdual simplex algorithm

Mathematics Subject Classification ID

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

Cites work

• Handling Artificial Variables in Simplex Method
• scientific article; zbMATH DE number 3523317 (Why is no real title available?)
• Upper Bounds, Secondary Constraints, and Block Triangularity in Linear Programming

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

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