The simplex SON algorithm for LP/embedded network problems

This paper develops a special partitioning method for solving LP problems with embedded network structure. These problems include many of the large-scale LP problems of practical importance, particularly in the fields of energy, scheduling, and distribution. The special partitioning method, called the simplex special ordered network (SON) procedure, applies to LP problems that contain both non-network rows and non-network columns, with no restriction on the form of the rows and columns that do not exhibit a network structure.

[1]  G. Dantzig.  UPPER BOUNDS, SECONDARY CONSTRAINTS, AND BLOCK TRIANGULARITY IN LINEAR PROGRAMMING , 1955 .

[2]  Abraham Charnes,et al.  Management Models and Industrial Applications of Linear Programming , 1961 .

[3]  R. Kaul.  AN EXTENSION OF GENERALIZED UPPER BOUNDED TECHNIQUES FOR LINEAR PROGRAMMING , 1965 .

[4]  John M. Bennett,et al.  An Approach to Some Structured Linear Programming Problems , 1966, Oper. Res..

[5]  J. A. Tomlin,et al.  Minimum-Cost Multicommodity Network Flows , 1966, Oper. Res..

[6]  M. D. Bakes,et al.  Solution of Special Linear Programming Problems with Additional Constraints , 1966 .

[7]  J A Tomlin.  Mathematical programming models for traffic network problems , 1967 .

[8]  George B. Dantzig,et al.  Generalized Upper Bounding Techniques , 1967, J. Comput. Syst. Sci..

[9]  A. Heesterman.  Special simplex algorithm for multi-sector problems , 1968 .

[10]  Klaus Ritter,et al.  A Decomposition Method for Structured Linear and Nonlinear Programs , 1969, J. Comput. Syst. Sci..

[11]  John E. Cremeans,et al.  Optimal multicommodity network flows with resource allocation , 1970 .

[12]  J. K. Hartman,et al.  A Generalized Upper Bounding Method for Doubly Coupled Linear Programs , 1970 .

[13]  Richard D. Wollmer,et al.  Multicommodity networks with resource constraints: The generalized multicommodity flow problem , 1971, Networks.

[14]  Leon S. Lasdon,et al.  A generalized upper bounding algorithm for multicommodity network flow problems , 1971, Networks.

[15]  Cary Robert Swoveland.  Decomposition algorithms for the multi-commodity distribution problem , 1971 .

[16]  Gerald L. Thompson,et al.  Accelerated Algorithms for Labeling and Relabeling of Trees, with Applications to Distribution Problems , 1972, JACM.

[17]  John E. Cremeans,et al.  THE MULTICOMMODITY NETWORK FLOW MODEL REVISED TO INCLUDE VEHICLE PER TIME PERIOD AND NODE CONSTRAINTS , 1972 .

[18]  Cary Swoveland.  A Two-Stage Decomposition Algorithm For A Generalized Multi-Commodity Flow Problem , 1973 .

[19]  Philip Wolfe,et al.  Validation of subgradient optimization , 1974, Math. Program..

[20]  H. Chen,et al.  A generalized chain labelling algorithm for solving multicommodity flow problems , 1974, Comput. Oper. Res..

[21]  Fred W. Glover,et al.  Implementation and computational comparisons of primal, dual and primal-dual computer codes for minimum cost network flow problems , 1974, Networks.

[22]  Fred W. Glover,et al.  Past, present and future of large scale transshipment computer codes and applications , 1975, Comput. Oper. Res..

[23]  Fred Glover,et al.  Capsule View of Future Developments on Large Scale Network and Network-Related Problems , 1975 .

[24]  Darwin Klingman,et al.  Solving Constrained Transportation Problems , 1972, Oper. Res..

[25]  L. Schrage.  Implicit representation of variable upper bounds in linear programming , 1975 .

[26]  P. Macdonald.  Combinatorial Programming: Methods and Applications , 1976 .

[27]  John W. Hultz,et al.  Solving Constrained Generalized Network Problems. , 1976 .

[28]  Gerald G. Brown,et al.  Design and Implementation of Large-Scale Primal Transshipment Algorithms , 1976 .

[29]  Arjang A. Assad.  Multicommodity network flows : computational experience , 1976 .

[30]  Richard D. McBride,et al.  The factorization approach to large-scale linear programming , 1976, Math. Program..

[31]  Darwin Klingman,et al.  The alternating basis algorithm for assignment problems , 1977, Math. Program..

[32]  J. Kennington,et al.  An Effective Subgradient Procedure for Minimal Cost Multicommodity Flow Problems , 1977 .

[33]  Fred Glover,et al.  Compact LP bases for a class of IP problems , 1977, Math. Program..

[34]  Darwin Klingman,et al.  IMPROVED COMPUTER-BASED PLANNING TECHNIQUES , 1977 .

[35]  Jeffery L. Kennington,et al.  A product form representation of the inverse of a multicommodity cycle matrix , 1977, Networks.

[36]  John W. Hultz,et al.  Solving singularly constrained generalized network problems , 1977 .

[37]  Darwin Klingman,et al.  Solving Singly Constrained Transshipment Problems , 1978 .

[38]  Fred Glover,et al.  Improved Computer-Based Planning Techniques, Part 1 , 1978 .

[39]  Linus Schrage,et al.  Implicit representation of generalized variable upper bounds in linear programming , 1978, Math. Program..

[40]  Darwin Klingman,et al.  Enhancements of Spanning Tree Labeling Procedures for Network Optimization. , 1979 .