Showing papers on "Bounding overwatch published in 1970"
TL;DR: The algorithm proposed is an extension of the generalized upper bounding method for problems without coupling columns that produces the same sequence of extreme point solutions as the primal simplex method, and hence has the desirable convergence properties of that algorithm.
Abstract: : The algorithm proposed is an extension of the generalized upper bounding method for problems without coupling columns. It produces the same sequence of extreme point solutions as the primal simplex method, and hence has the desirable convergence properties of that algorithm. However, the operations within each simplex iteration are organized to take maximal advantage of problem structure.
17 citations
TL;DR: In this article, the authors recast frame stability calculations into the form of a low order, nonlinear eigenvlaue problem and established upper and lower bounds on the sway buckling load.
Abstract: Frame stability calculations are recast into the form of a low order, nonlinear eigenvlaue problem. It is shown that at each stage of the iterative solution of the problem, upper and lower bounds on the sway buckling load are established. The conditions needed for convergence and bounding are examined and verified by several numerical problems. It is shown that under usual conditions bounding and convergence are obtained for any reasonable starting assumption of load factor. For unusual cases, the use of submembers is interpreted to be a means of avoiding numerical difficulties.
6 citations