Multiparametric Limit Analysis of Frames: Part II—Computations
- 1 March 1988
- journal article
- Published by American Society of Civil Engineers (ASCE) in Journal of Engineering Mechanics
- Vol. 114 (3) , 387-403
- https://doi.org/10.1061/(asce)0733-9399(1988)114:3(387)
Abstract
A systematic computational approach is developed for the generation of n‐dimensional global‐polyhedral‐limit hypersurfaces for frames. The maximal facets of the polyhedra are shown to correspond to unique failure modes. Algorithmic procedures are described for the identification of limit hypersurfaces and the individual failure modes. Bending‐moment distributions at collapse for each failure mode, load combinations leading to a given mode, and modal correlations can be obtained. Other structural properties of polyhedra are explored and illustrated with examples.Keywords
This publication has 15 references indexed in Scilit:
- Multiparametric Limit Analysis of Frames: Part I—ModelJournal of Engineering Mechanics, 1988
- Multiple Criteria Optimization; A State of the Art ReviewPublished by Springer Nature ,1985
- Generating all maximal efficient faces for multiple objective linear programsJournal of Optimization Theory and Applications, 1980
- Finding all efficient extreme points for multiple objective linear programsMathematical Programming, 1978
- Connectedness of the set of nondominated outcomes in multicriteria optimizationJournal of Optimization Theory and Applications, 1978
- The Enumeration of the Set of All Efficient Solutions for a Linear Multiple Objective ProgramJournal of the Operational Research Society, 1977
- A general method for determining the set of all efficient solutions to a linear vectormaximum problemEuropean Journal of Operational Research, 1977
- The set of all nondominated solutions in linear cases and a multicriteria simplex methodJournal of Mathematical Analysis and Applications, 1975
- A revised simplex method for linear multiple objective programsMathematical Programming, 1973
- Algorithms for the vector maximization problemMathematical Programming, 1972