Multidimensional max-flow method and its application for plastic analysis

This paper expands the use of network flows to the multidimensional case, in which network flows are associated with vectors, instead of the conventionally used scalar values. A method for solving a multidimensional max-flow problem is systematically developed, on the basis of the primal-dual algorithm. It is demonstrated that upon reduction to a one-dimensional case, the method is transformed to the known Ford and Fulkerson algorithm. This multidimensional flow network can be applied to a variety of engineering applications, as the variables underlying engineering systems frequently possess a vector form. In this paper, the multidimensional max-flow problem is shown to correspond to the problem of plastic analysis of trusses.

[1]  Carlo Gavarini.  Plastic analysis of structures and duality in linear programming , 1966 .

[2]  Steven J. Fenves,et al.  Network‐topological formulation of analysis and design of rigid‐plastic framed structures , 1971 .

[3]  Kenneth Steiglitz,et al.  Combinatorial Optimization: Algorithms and Complexity , 1981 .

[4]  Edsger W. Dijkstra,et al.  A note on two problems in connexion with graphs , 1959, Numerische Mathematik.

[5]  Claude Fleury,et al.  A primal-dual approach in truss topology optimization , 1997 .

[6]  G. Maier.  A matrix structural theory of piecewise linear elastoplasticity with interacting yield planes , 1970 .

[7]  Offer Shai,et al.  The multidisciplinary combinatorial approach (MCA) and its applications in engineering , 2001, Artificial Intelligence for Engineering Design, Analysis and Manufacturing.

[8]  Aris Phillips,et al.  Plastic Analysis of Structures , 1959 .

[9]  M. Z. Cohn,et al.  Computer Analysis of Elastic-Plastic Structures , 1980 .

[10]  B. Neal.  Plastic Methods of Structural Analysis , 1963 .

[11]  Ali Kaveh,et al.  Structural Mechanics: Graph and Matrix Methods , 1995 .

[12]  Yuval Rabani,et al.  Linear Programming , 2007, Handbook of Approximation Algorithms and Metaheuristics.

[13]  Ikuyo Kaneko.  Piecewise linear elastic–plastic analysis , 1979 .

[14]  William Prager.  Mathematical Programming and Theory of Structures , 1965 .

[15]  Steven J. Fenves,et al.  NETWORK-TOPOLOGICAL FORMULATION OF STRUCTURAL ANALYSIS , 1963 .

[16]  P S Symonds,et al.  THE CALCULATION OF COLLAPSE LOADS FOR FRAMED STRUCTURES. (INCLUDES APPENDIX). , 1950 .

[17]  George B. Dantzig,et al.  7* A Primal-Dual Algorithm for Linear Programs , 1957 .

[18]  D. R. Fulkerson,et al.  On the Max Flow Min Cut Theorem of Networks. , 1955 .

[19]  A. Recski.  Matroid theory and its applications in electric network theory and in statics , 1989 .

[20]  Offer Shai,et al.  Transforming engineering problems through graph representations , 2003, Adv. Eng. Informatics.

[21]  B. G. Neal,et al.  Recent progress in the plastic methods of structural analysis , 1951 .

[22]  P S Symonds,et al.  THE CALCULATIONS OF COLLAPSE LOADS FOR FRAMED STRUCTURES , 1951 .

[23]  A. Tucker,et al.  Linear Inequalities And Related Systems , 1956 .

[24]  W. Cassie.  Plastic Methods of Structural Analysis , 1957, Nature.