Finding Stable Orientations of Assemblies with Linear Programming.

摘要

The stability of an assemblage of frictionless contacting bodies with uniform gravity was considered. The problem of finding a stable orientation for such an assembly was formulated as a constrained maximin problem. A solution to the maximin problem yielded an orientation of the assembly that was stable under gravity; however, if no such orientation existed, then the solution to the maximin problem yielded the most stable orientation possible for the assembly. The maximin problem was solved using a numerical iteration procedure that solved a linear program for each step of the iteration. In this paper, we show that the stability problem can be considered a variant of standard zero-sum matrix games. A solution to the maximin problem can be found by solving a single linear program.