A computational approach to pivot selection in the LP relaxation of set problems

DOI10.1155/JAMDS/2006/76187zbMath1161.90434OpenAlexW2020330392MaRDI QIDQ955467

B. Rostamy, F. Djannaty

Publication date: 20 November 2008

Published in: Journal of Applied Mathematics and Decision Sciences (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/129912

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Linear programming (90C05) Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08)

Uses Software

• DEVEX

Cites Work

• Unnamed Item
• Unnamed Item
• Network based heuristics for the set covering problem
• Steepest-edge simplex algorithms for linear programming
• A practicable steepest-edge simplex algorithm
• Letter to the Editor—On Upper Bounds for the Number of Iterations in Solving Linear Programs

This page was built for publication: A computational approach to pivot selection in the LP relaxation of set problems