A solution comparison for dual angular linear programs

DOI10.1016/0305-0548(87)90023-2zbMath0617.90060OpenAlexW2026667162MaRDI QIDQ1088904

Stephen P. jun. Shao

Publication date: 1987

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0305-0548(87)90023-2

zbMATH Keywords

Computational resultsstaircase problemsdual structured linear programsDualplex Method

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Numerical mathematical programming methods (65K05) Linear programming (90C05)

Related Items (2)

Knowledge based approach to the cutting stock problem ⋮ Solving discrete stochastic linear programs with simple recourse by the dualplex algorithm

Cites Work

• Unnamed Item
• Unnamed Item
• On the solution of special generalized upper-bounded problems: The LP/GUB knapsack problem and the λ-form separable convex objective function problem

This page was built for publication: A solution comparison for dual angular linear programs