Abstract
Factorization of linear programming (LP) models enables a large portion of the LP tableau to be represented implicitly and generated from the remaining explicit part. Dynamic factorization admits algebraic elements which change in dimension during the course of solution. A unifying mathematical framework for dynamic row factorization is presented with three algorithms which derive from different LP model row structures: generalized upper bound rows, pure network rows, and generalized network rows. Each of these structures is a generalization of its predecessors, and each corresponding algorithm exhibits just enough additional richness to accommodate the structure at hand within the unified framework. Implementation and computational results are presented for a variety of real-world models. These results suggest that each of these algorithms is superior to the traditional, non-factorized approach, with the degree of improvement depending upon the size and quality of the row factorization identified.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
A.V. Aho, J.E. Hopcroft and J.D. Ullman,The Design and Analysis of Computer Algorithms (Addison-Wesley, Menlo Park, CA, 1974).
A. Assad, “Multicommodity network flows — A survey,”Networks 8 (1978) 37–91.
W. Avery, G.G. Brown, J.A. Rosenkranz and R.K. Wood, “Optimization of purchase, storage and transmission contracts for natural gas utilities,”Operations Research, 40(3) (1992) 446–462.
M.L. Balinski and R.L. Gomory, “A mutual primal—dual simplex method,” in:Recent Advances in Mathematical Programming (McGraw-Hill, New York, 1963).
J.F. Benders, “Partitioning procedure for solving mixed-variables programming problems,”Numerische Mathematik 4 (1962) 238–252.
R.E. Bixby and R. Fourer, “Finding embedded network rows in linear programs I: Extraction heuristics,” Report No. 86437-OR, Oekonometrie und Operations Research, Bonn University (Bonn, 1986).
G.H. Bradley, “Optimization of capital portfolios,”Proceedings of the National Communications Forum 86 (1986) pp. 11–17.
G.H. Bradley, G.G. Brown and G.W. Graves, “Design and implementation of large-scale primal transshipment algorithms,”Management Science 24(1) (1977) 1–34.
A.L. Brearley, G. Mitra and H.P. Williams, “Analysis of mathematical programming problems prior to applying the simplex algorithm,”Mathematical Programming 8 (1978) 54–83.
G.G. Brown, R.D. Clemence Jr., W.R. Teufert and R.K. Wood, “An optimization model for modernizing the army's helicopter fleet,”Interfaces 21(4) (1990) 39–52.
G.G. Brown, D.A. Drake, A.B. Marsh and A. Washburn, “Mathematical methods applied to managing a system of direction-finding receivers,” Military Operations Research Society (Annapolis, MD, 1990).
G.G. Brown and G.W. Graves, “Elastic programming: A new approach to large-scale mixed-integer optimization,” presented at ORSA/TIMS meeting, Las Vegas, NV (1975).
G.G. Brown, G.W. Graves and D. Ronen, “Scheduling ocean transportation of crude oil,”Management Science 33(3) (1987) 335–346.
G.G. Brown, J.W. Mamer, R.D. McBride and R.K. Wood, “Solving a large-scale generalized multi-commodity flow problem,” ORSA/TIMS (San Francisco, CA, 1992).
G.G. Brown and R.D. McBride, “Solving generalized networks,”Management Science 30(12) (1984) 1497–1523.
G.G. Brown, R.D. McBride and R.K. Wood, “Extracting embedded generalized networks from linear programming problems,”Mathematical Programming Study 32 (1985) 11–31.
G.G. Brown and D. Thomen, “Automatic identification of generalized upper bounds in large-scale optimization models,”Management Science 26(11) (1980) 1166–1184.
G.G. Brown and W. Wright, “Automatic identification of embedded network rows in large-scale optimization models,”Mathematical Programming 29 (1984) 41–56.
A. Charnes and C.E. Lemke, “Computational theory of linear programming, I: The bounded variables problem,” ONR Research Memorandum 10, Graduate School of Industrial Administration, Carnegie Institute of Technology (Pittsburgh, PA, 1952).
C. Chen and M. Engquist, “A primal simplex approach to pure processing networks,”Management Science 32(12) (1986) 1582–1598.
S. Chen and R. Saigal, “A primal algorithm for solving a capacitated network flow problem with additional linear constraints,”Networks 7 (1977) 59–79.
R.D. Clemence Jr., W.R. Teufert, G.G. Brown and R.K. Wood, “Phoenix: Developing and evaluating army aviation modernization policies using mixed integer linear programming,”27th U.S. Army Operations Research Symposium (Fort Lee, VA, 1988).
CPLEX Optimization, Inc.,Using the CPLEX(TM) Linear Optimizer (Version 1.2) (Incline Village, NV, 1990).
CPLEX Optimization, Inc.,Using the CPLEX(TM) Linear Optimizer and CPLEX(TM) Mixed Integer Optimizer (Version 2.0) (Incline Village, NV, 1992).
G.B. Dantzig, “Notes on linear programming: Parts VIII, IX, X-upper bounds, secondary constraints, and block triangularity in linear programming,” Research Memorandum RM-1367, The Rand Corporation (Santa Monica, CA, 1954).
G.B. Dantzig,Linear Programming and Extensions (Princeton University Press, Princeton, NJ, 1963).
G.B. Dantzig and R.M. Van Slyke, “Generalized upper bounding techniques,”Journal of Computer and System Sciences 1 (1967) 213–226.
G.B. Dantzig and P. Wolfe, “Decomposition principal for linear programming,”Operations Research 8(1) (1960) 101–111.
A.M. Geoffrion and G.W. Graves, “Multicommodity distribution system design by Benders decomposition,”Management Science 29(5) (1974) 822–844.
F. Glover, “Transformations enlarging the network portion of a class of LP/embedded generalized networks,” MSRS 80-1, University of Colorado (Boulder, CO, 1980).
F. Glover, J. Hultz, D. Klingman and J. Stutz, “Generalized networks” A fundamental computer-based planning tool,”Management Science 24(12) (1978) 1209–1220.
F. Glover, D. Karney, D. Klingman and R. Russell, “Solving singly constrained transshipment problems,”Transportation Science 12(4) (1978) 277–297.
F. Glover and D. Klingman, “The simplex SON algorithm for LP/embedded network problems,”Mathematical Programming Study 15 (1981) 148–176.
G.H. Golub and C.F. Van Loan,Matrix Computations (The Johns Hopkins University Press, Baltimore, MD, 1983).
G.W. Graves, “A complete constructive algorithm for the general mixed linear programming problem,”Naval Research Logistics Quarterly 12(1) (1965) 1–14.
G.W. Graves and R.D. McBride, “The factorization approach to large-scale linear programming,”Mathematical Programming 10 (1976) 91–110.
H.J. Greenberg and D.C. Rarick, “Determining GUB sets via an invert agenda algorithm,”Mathematical Programming 7 (1974) 240–244.
G. Gunawardane and L. Schrage, “Identification of special structure constraints in linear programs,” University of Chicago (Chicago, IL, 1977).
T.P. Harrison, G.H. Bradley and G.G. Brown, “Capital allocation and project selection via decomposition,” presented at CORS/TIMS/ORSA meeting, Vancouver, BC (1989).
T.P. Harrison, B.C. Arntzen and G.G. Brown, “Global manufacturing strategy analysis,” presented at ORSA/TIMS meeting, Orlando, FL (1992).
T.P. Harrison, Private communication (1992).
J.K. Hartman and L.S. Lasdon, “A generalized upper bounding method for doubly coupled linear programs,” Technical Memorandum No. 140 (1970).
J.K. Hartman and L.S. Lasdon, “A generalized upper bounding algorithm for multicommodity network flow problems,”Networks 1 (1972) 333–354.
R.V. Helgason and J.L. Kennington, “A product form representation of the inverse of a multicommodity cycle matrix,”Networks 7 (1977) 297–322.
E. Hellerman and D. Rarick, “Reinversion and the preassigned pivot procedure,”Mathematical Programming 1 (1971) 195–216.
E. Hellerman and D. Rarick, “The partitioned preassigned pivot procedure (P 4),” in: D.J. Rose and P.A. Willoughby, eds.,Sparse Matrices and their Applications (Plenum, New York, 1972) pp. 67–76.
J. Hultz and D. Klingman, “Solving constrained generalized network problems,” Research Report CCS 257, Center for Cybernetic Studies, University of Texas at Austin (Austin, TX, 1976).
J. Hultz and D. Klingman, “Solving singularly constrained generalized network problems,”Applied Mathematics and Optimization 4 (1978) 103–119.
IBM Corporation,Optimization Subroutine Library Guide and Reference Release 2 (Kingston, NY, 1991).
J.A. Jackson, “A taxonomy of advanced linear programming techniques and the theater attack model,” Master's Thesis, Air Force Institute of Technology, Air University (Wright—Patterson Air Force Base, OH, 1989).
J.L. Kennington, “Solving multicommodity transportation problems using a primal partitioning simplex technique,”Naval Research Logistics Quarterly 24(2) (1977) 309–325.
J.L. Kennington, “A survey of linear cost multicommodity network flows,”Operations Research 26 (1978) 209–236.
D. Klingman and R. Russell, “On solving constrained transportation problems,”Operations Research 23(1) (1975) 91–107.
D. Klingman and R. Russell, “A streamlined simplex approach to the singly constrained transportation problem,”Naval Research Logistics Quarterly 25(4) (1978) 681–696.
J. Koene, “Minimal cost flow in processing networks, a primal approach,” Ph.D. Thesis, Eindhoven University of Technology (Eindhoven, The Netherlands, 1982).
R.D. McBride, “Factorization in large-scale linear programming,” Working Paper No. 22, University of California (Los Angeles, CA, 1972).
R.D. McBride, “A bump triangular dynamic factorization algorithm for the simplex method,”Mathematical Programming 18 (1980) 49–61.
R.D. McBride, “Solving embedded generalized network problems,”European Journal of Operational Research 21 (1985) 82–92.
R.D. McBride, Private communication (1989).
R.J. Might, “Decision support for aircraft and munitions procurement,”Interfaces 17(5) (1987) 55–63.
B.A. Murtagh and M.A. Saunders, “MINOS user's guide,” Technical Report SOL 77-9, Systems Optimization Laboratory, Department of Operations Research, Stanford University (Stanford, CA, 1977).
M.P. Olson, “Dynamic factorization in large-scale optimization,” Doctoral Dissertation, Naval Postgraduate School (Monterey, CA, 1989).
S. Powell, “A development of the product form algorithm for the simplex method using reduced transformation vectors,”Mathematical Programming 9 (1975) 93–107.
J.B. Rosen, “Primal partition programming for block diagonal matrices,”Numerical Mathematics 6 (1964) 250–260.
M.A. Saunders, “A fast, stable implementation of the simplex method using Bartels—Golub Updating,” in: J.R. Bunch and D.J. Rose, eds.,Sparse Matrix Computations (Academic Press, New York, 1976) pp. 213–226.
L. Schrage, “Implicit representation of variable upper bounds in linear programming,”Mathematical Programming 4 (1975) 118–132.
L. Schrage, “Implicit representation of generalized variable upper bounds in linear programming,”Mathematical Programming 14 (1978) 11–20.
L. Schrage, “Some comments on hidden structure in linear programs,” in: H.J. Greenberg and I. Maybee, eds.,Computer-assisted Analysis and Model Simplification (Academic Press, New York, 1981) pp. 389–395.
C.J. Staniec, “Design and solution of an ammunition distribution model by a resource-directive multicommodity network flow algorithm,” Master's Thesis, Naval Postgraduate School (Monterey, CA, 1984).
J. Sterling, “An EA-6B transmitter loading and assignment model,” Master's Thesis, Naval Postgraduate School (Monterey, CA, 1990).
M.J. Todd, “Large-scale linear programming: Geometry, working bases and factorization,”Mathematical Programming 26(1) (1983) 1–20.
R.K. Wood, Private communication (1989).
G. Zoutendijk, “A product-form algorithm using contracted transformation vectors,” in: J. Abadie, ed.,Integer and Nonlinear Programming (North-Holland, Amsterdam, 1970).
Author information
Authors and Affiliations
Additional information
Corresponding author.
Rights and permissions
About this article
Cite this article
Brown, G.G., Olson, M.P. Dynamic factorization in large-scale optimization. Mathematical Programming 64, 17–51 (1994). https://doi.org/10.1007/BF01582564
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF01582564