A constraint selection technique in limit analysis
From MaRDI portal
Publication:1823877
DOI10.1016/0307-904X(89)90157-1zbMath0681.90089OpenAlexW2006709159MaRDI QIDQ1823877
Publication date: 1989
Published in: Applied Mathematical Modelling (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0307-904x(89)90157-1
Numerical mathematical programming methods (65K05) Applications of mathematical programming (90C90) Linear programming (90C05) Fracture and damage (74R99)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- A note on detecting simple redundancies in linear systems
- Redundancy in mathematical programming. A state-of-the-art survey
- Finding duplicate rows in a linear programming model
- A constraint selection technique for a class of linear programs
- A matrix structural theory of piecewise linear elastoplasticity with interacting yield planes
- On Trivial and Binding Constraints in Programming Problems
- Optimal shakedown design of frames by linear programming
- New Methods in Mathematical Programming—Methods of Solution of Linear Programs Under Uncertainty
- Analysis of mathematical programming problems prior to applying the simplex algorithm
- On automatic selection of redundancies
- The pivot and probe algorithm for solving a linear program
- Techniques for Removing Nonbinding Constraints and Extraneous Variables from Linear Programming Problems
- A finite element approach to optimal design of plastic structures in plane stress
- Some Properties of Redundant Constraints and Extraneous Variables in Direct and Dual Linear Programming Problems
This page was built for publication: A constraint selection technique in limit analysis