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 resultsdual structured linear programsDualplex Methodstaircase problems

Mathematics Subject Classification ID

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

Review text

Computational results are reported for Gass' Dualplex Method which is designed to solve dual structured linear programs. The test problem set includes a group of staircase problems from such diverse areas as economic development, agricultural planning, and cutting stock models. Each test problem is solved by an experimental dualplex code and an efficient commercial version of the simplex algorithm for comparative purposes. Based on the test problem results, the dualplex method is found to exhibit very good solution behavior and have steeper solution convergence than the commercial simplex code.

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
• Knowledge based approach to the cutting stock problem
• Solving discrete stochastic linear programs with simple recourse by the dualplex algorithm
• 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)