A timing model for the revised simplex method☆
References (8)
Linear Programming
(1983)- et al.
The product form for the inverse in the simplex method
Mathematical Tables and Other Aids to Computation
(1954) Electronic mail distribution of linear programming test problems
COAL Newsletter
(1985)How many parts to make at once
Factory, the Magazine of Management
(1913)How many parts to make at once
Factory, the Magazine of Management
(1913)
Cited by (3)
Alternative model representations and computing capacity: Implications for model management
2006, Decision Support SystemsCitation Excerpt :In order to actually implement such a design, however, the computational profile (i.e., the solution times across the different representations for various levels of computing capacity) must be predictable in advance. Our approach to accomplishing this is through the use of a timing model [13,14]. A timing model can be described as a mathematical characterization that accounts for the total time spent by the algorithm by relating it to various parameters such as model size, model representation, computing capacity, and computing architecture.
Distributed Nested Decomposition of Staircase Linear Programs
1997, ACM Transactions on Mathematical SoftwareOn the efficacy of distributed simplex algorithms for linear programming
1994, Computational Optimization and Applications
- ☆
Research supported in part by the Office of Naval Research under grant N00014-90-J-1796 to the University of Tennessee where the work was initiated. Presented at the 14th International Symposium on Mathematical Programming in Amsterdam, August 5–9, 1991.