The OPTLP Procedure
- Overview
- Getting Started
-
Syntax
-
DetailsData Input and OutputPresolvePricing Strategies for the Primal and Dual Simplex AlgorithmsWarm Start for the Primal and Dual Simplex AlgorithmsThe Network Simplex AlgorithmThe Interior Point AlgorithmIteration Log for the Primal and Dual Simplex AlgorithmsIteration Log for the Network Simplex AlgorithmIteration Log for the Interior Point AlgorithmIteration Log for the Crossover AlgorithmConcurrent LPParallel ProcessingODS TablesIrreducible Infeasible SetMacro Variable _OROPTLP_
-
Examples
- References
References
-
Ahuja, R. K., Magnanti, T. L., and Orlin, J. B. (1993). Network Flows: Theory, Algorithms, and Applications. Englewood Cliffs, NJ: Prentice-Hall.
-
Andersen, E. D., and Andersen, K. D. (1995). “Presolving in Linear Programming.” Mathematical Programming 71:221–245.
-
Chinneck, J. W. (2008). Feasibility and Infeasibility in Optimization: Algorithms and Computational Methods. Vol. 118 of International Series in Operations Research and Management Science. New York: Springer.
-
Dantzig, G. B. (1963). Linear Programming and Extensions. Princeton, NJ: Princeton University Press.
-
Forrest, J. J., and Goldfarb, D. (1992). “Steepest-Edge Simplex Algorithms for Linear Programming.” Mathematical Programming 5:1–28.
-
Gondzio, J. (1997). “Presolve Analysis of Linear Programs Prior to Applying an Interior Point Method.” INFORMS Journal on Computing 9:73–91.
-
Harris, P. M. J. (1973). “Pivot Selection Methods in the Devex LP Code.” Mathematical Programming 57:341–374.
-
Maros, I. (2003). Computational Techniques of the Simplex Method. Boston: Kluwer Academic.