A sphere packing approach to multi-parametric optimization
DOI:
https://doi.org/10.5564/jimdt.v6i1.3639Keywords:
Sphere Packing, Multi-Parametric Optimization, Robust Linear Programming, Multi Objective Optimization, Inverse ProblemsAbstract
This paper introduces a novel application of sphere packing theory to multi-parametric optimization problems. Sphere packing, a classical problem in geometry, provides a powerful geometric framework for analyzing the robustness and feasibility of solutions in linear programming, inverse optimization, and multi-objective optimization problems. By inscribing the largest possible spheres within feasible regions, we develop robust solutions that can tolerate small perturbations in constraints or objectives. We derive theoretical results connecting sphere packing to linear programming, formulate robust solutions as ε-solutions, and address inverse optimization problems by maximizing the robustness of target solutions. A practical case study involving a mining company demonstrates the applicability of the proposed framework in real-world multi-objective scenarios. This approach enhances traditional optimization techniques by incorporating geometric insights, scalability, and robustness.
Downloads
170
References
[1] J. H. Conway, N. J. A. Sloane, Sphere Packings, Lattices and Groups, Springer, 1998. https://doi.org/10.1007/978-1-4757-6568-7 .
[2] C. Zong, Sphere Packings, Springer, 1999.
[3] A. Ben-Tal, A. Nemirovski, “Robust solutions of optimization problems affected by uncertain probabilities”, Mathematical Programming, Vol. 122, pp. 311-330, 2009.
[4] L. El Ghaoui, H. Lebret, “Robust solutions to uncertain linear programs,” SIAM Journal on Optimization, Vol. 9, pp. 668-688, 1998.
[5] R. J. Vanderbei, Linear Programming: Foundations and Extensions, Springer, 2014. https://doi.org/10.1007/978-1-4614-7630-6.
[6] C. E. Shannon, “A mathematical theory of communication”, The Bell System Technical Journal, Vol. 27, pp. 379-423, 1948. https://doi.org/10.1002/j.1538-7305.1948.tb01338.x
[7] H. Wolkowicz and others, Handbook of Semidefinite Programming: Theory, Algorithms, and Applications, Springer, 2012.
[8] U. Kerkow, “Multi-objective optimization under uncertainty”, Optimization Journal, Vol. 52, pp. 275-293, 2003.
[9] R. T. Marler, J. S. Arora, “Weighted and bounded constraints methods for multi-objective optimization”, Engineering Optimization, Vol. 42, pp. 137-160, 2010.
[10] R. Enkhbat, Convex Maximization Formulation of General Sphere Packing Problem, Springer, 2020.
[11] E. Erkut and others, “Facility location models for competitive environments”, European Journal of Operational Research, Vol. 129, pp. 361-371, 2003. https://doi.org/10.1061/(ASCE)1090-0241(2003)129:4(361).
[12] R. K. Ahuja, J. B. Orlin “Inverse Optimization”, Operations Research, Vol. 49, pp. 771-783, 2001, https://doi.org/10.1287/opre.49.5.771.10607
[13] D. Bertsimas, M. Sim, “The Price of Robustness”, Operations Research, Vol. 52, pp. 35-53, 2004, https://doi.org/10.1287/opre.1030.0065
[14] J. Guddat, F. G. Vazquez, D. Nowack and J. J. Ruckmamr, “Pathfollowing methods for nonlinear multiobjective optimization problems”, International Journal of Management Science and Engineering Management, Vol. 2, pp. 163-177, 2007, https://doi.org/10.1080/17509653.2007.10671019
Downloads
Published
How to Cite
Issue
Section
License
Copyright (c) 2024 Lutbat Yadamsuren, Ulziibayar Vandandoo, Enkhbat Rentsen
This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License.
The authors grant the Journal of Institute of Mathemathics and Digital Technology a license to publish the article and identify itself as the original publisher.
Articles in the Journal of Institute of Mathemathics and Digital Technology are Open Access articles published under a Creative Commons Attribution-NonCommercial 4.0 International License - CC BY NC.
This license permits NonComericial use, distribution and reproduction in any medium, provided the original work is properly cited.
