Speaker: Enkhbat Rentsen(Institute of Mathematics and Digital Technology, Mongolian Academy of Sciences)

Time: 11:00-12:00 a.m., Dec 3, 2024, GMT+8

Venue: Online
ZOOM Link: https://zoom.us/j/94696706470?pwd=cMBc85cahAB1F5DJqYzlfWuN6onwaZ.1
Meeting ID: 946 9670 6470
Password:198257

Abstract: 

We consider a general (constrained) sphere packing problem which is to pack non-overlapping spheres  with the maximum volume into a convex set. We show that the problem reduces to a global optimization problem.  First, we survey existing theory, methods and algorithms for solving the sphere packing problems as well as their industrial applications.  Also, we formulate a new optimal control problem based on sphere packing problem.  Inspired by  Malfatti’s and Sangaku problems, we examine these problems from a view point of sphere packing theory. Applications of sphere packing problems in business are discussed.

Source: Beijing International Center for Mathematical Research, PKU