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.


Bio Sketch: 
Dr. Enkhbat earned his M.S. and Ph.D. in Applied Mathematics from Irkutsk State University, Russia, in 1980 and 1990, respectively. He furthered his expertise with a Sc.D. in Applied Mathematics from the Mongolian Academy of Sciences(MAS) in 2003. He served as the Director of the Institute of Mathematics at National University of Mongolia from 2011 to 2015 and currently as the Head of the Department of Mathematics of Institute of Mathematics and Digital Technology at MAS since 2019.