Abstract
This article deals with the problem of packing convex polytopes into a parallelepiped of minimal height. It is assumed that the polytopes are oriented, i.e. rotations are not permitted. A mathematical model of the problem is developed and peculiarities of them are addressed. Based on these peculiarities an exact method to compute local optimal solutions is constructed. This method uses a special modification of the Simplex method. Some examples are also given.
Acknowledgement
The authors wish to thank the anonymous referee for her/his valuable remarks and hints which helped a lot to improve the presentation. This work was partially supported by the German Research Society (DFG, grant TE 207/7, 436 UKR 113/42/0).