Design of planar articulated mechanisms using branch and bound

DOI10.1007/s10107-005-0586-3zbMath1066.70006OpenAlexW2068011066WikidataQ56050752 ScholiaQ56050752MaRDI QIDQ1780959

Mathias Stolpe, Atsushi Kawamoto

Publication date: 14 June 2005

Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10107-005-0586-3

zbMATH Keywords

optimizationconvex relaxationselastic stability

Mathematics Subject Classification ID

Applications of mathematical programming (90C90) Rods (beams, columns, shafts, arches, rings, etc.) (74K10) Optimization of other properties in solid mechanics (74P10) Kinematics of mechanisms and robots (70B15) Robot dynamics and control of rigid bodies (70E60)

Related Items

Global optimization of truss topology with discrete bar areas. II: Implementation and numerical results ⋮ Truss topology optimization with discrete design variables -- guaranteed global optimality and benchmark examples ⋮ Modeling and optimal design of neuro-mechanical shape memory devices ⋮ Topology optimization of planar linkage mechanisms ⋮ Global optimization of trusses with constraints on number of different cross-sections: a mixed-integer second-order cone programming approach ⋮ On the reformulation of topology optimization problems as linear or convex quadratic mixed 0-1 programs

Uses Software

• SNOPT
• SeDuMi

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Jointly constrained bilinear programs and related problems: An overview
• Generalized bilinear programming. I: Models, applications and linear programming relaxation
• Buckminster fuller's tensegrity structures and Clerk Maxwell's rules for the construction of stiff frames
• A branch and contract algorithm for problems with concave univariate, bilinear and linear fractional terms
• Advanced preprocessing techniques for linear and quadratic programming
• A symmetry extension of Maxwell's rule for rigidity of frames
• Synthesis of mechanisms using time-varying dimensions
• Presolving in linear programming
• A branch-and-reduce approach to global optimization
• A Branch-and-Cut Algorithm for the Resolution of Large-Scale Symmetric Traveling Salesman Problems
• Optimal Design of Truss Structures by Logic-Based Branch and Cut
• Jointly Constrained Biconvex Programming
• Equivalent displacement based formulations for maximum strength truss topology design
• Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems
• Optimal Truss Design by Interior-Point Methods
• Potential Reduction Polynomial Time Method for Truss Topology Design
• Preprocessing and Probing Techniques for Mixed Integer Programming Problems
• A bilinear approach to the pooling problem†
• Robust Truss Topology Design via Semidefinite Programming
• Modelling topology optimization problems as linear mixed 0-1 programs
• Using SeDuMi 1.02, A Matlab toolbox for optimization over symmetric cones
• SNOPT: An SQP Algorithm for Large-Scale Constrained Optimization
• Semidefinite Programming
• A New Method for Optimal Truss Topology Design
• Global optimization of minimum weight truss topology problems with stress, displacement, and local buckling constraints using branch‐and‐bound
• Articulated mechanism design with a degree of freedom constraint
• Optimal design of trusses under a nonconvex global buckling constraint

This page was built for publication: Design of planar articulated mechanisms using branch and bound