Packing non-equal hyperspheres into a hypersphere of minimal radius
The problem of packing different hyperspheres into a hypersphere of minimal radius is considered. All hypersphere radii are supposed to be variable. Solving the problem is reduced to solving a sequence of mathematical programming problems. A special way of construction of starting pointsis suggeste...
Saved in:
| Date: | 2014 |
|---|---|
| Main Author: | |
| Format: | Article |
| Language: | English |
| Published: |
Інститут енергетичних машин і систем ім. А. М. Підгорного Національної академії наук України
2014
|
| Subjects: | |
| Online Access: | https://journals.uran.ua/jme/article/view/27174 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Journal Title: | Energy Technologies & Resource Saving |
Institution
Energy Technologies & Resource Saving| Summary: | The problem of packing different hyperspheres into a hypersphere of minimal radius is considered. All hypersphere radii are supposed to be variable. Solving the problem is reduced to solving a sequence of mathematical programming problems. A special way of construction of starting pointsis suggested. A smooth transition from one local minimum point to another providing a decrease of the objective value is realized using the jump algorithm is fulfilled. Then, solution results are improved due to reduction of the solution space dimension by step-by-step fixing radii of hyperspheres and rearrangements of hypersphere pairs. Non-linear mathematical programming problems are solved with the IPOPT (Interior Point Optimizer) solver and the concept of active inequalities. A number of numerical results are given. |
|---|