A solution comparison for dual angular linear programs

DOI10.1016/0305-0548(87)90023-2MaRDI QIDQ1088904zbMATH OpenOpenAlexFDO

Authors 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

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

Recommendations

• Solving discrete stochastic linear programs with simple recourse by the dualplex algorithm
• A generalized dual phase-2 simplex algorithm.
• A dual projective simplex method for linear programming
• On solution of multicoupled models
• scientific article; zbMATH DE number 4027166

Cites work

• scientific article; zbMATH DE number 3333881 (Why is no real title available?)
• scientific article; zbMATH DE number 3356467 (Why is no real title available?)
• On the solution of special generalized upper-bounded problems: The LP/GUB knapsack problem and the λ-form separable convex objective function problem

Cited in

(4)

• On solution of multicoupled models
• Solving discrete stochastic linear programs with simple recourse by the dualplex algorithm
• Knowledge based approach to the cutting stock problem
• Das Triplex-Verfahren

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

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