Abstract
We present an optimization problem emerging from optimal control theory and situated at the intersection of fractional programming and linear max-min programming on polytopes. A naïve solution would require solving four nested, possibly nonlinear, optimization problems. Instead, relying on numerous geometric arguments we determine an analytical solution to this problem. In the course of proving our main theorem, we also establish another optimization result stating that the minimum of a specific minimax optimization is located at a vertex of the constraint set.
Similar content being viewed by others
References
Abdel-Baset, M., Ibrahim, M.H.: An improved flower pollination algorithm for ratios optimization problems. Appl. Math. Inform. Sci. Lett.: Int. J. 3(2), 83–91 (2015). https://doi.org/10.12785/amisl/030206
Aliprantis, C., Border, K.: Infinite dimensional analysis: a hitchhiker’s guide. Springer, New York (2006)
Bouvier, J.B., Xu, K., Ornik, M.: Quantitative resilience of linear driftless systems. In: SIAM Conference on Control and its Applications, pp. 32 – 39. SIAM (2021)
Charnes, A., Cooper, W.W.: Programming with linear fractional functionals. Naval Res. Logist. Q. 9(3–4), 181–186 (1962). https://doi.org/10.1002/nav.3800090303
Du, D.Z., Pardalos, P.M.: A continuous version of a result of Du and Hwang. J. Glob. Optim. 5(2), 127–129 (1994)
Du, D..Z., Pardalos, P..M.: Minimax and applications, vol. 4. Springer Science & Business Media, New York (2013)
Hettich, R., Kortanek, K.O.: Semi-infinite programming: theory, methods, and applications. SIAM Rev. 35(3), 380–429 (1993). https://doi.org/10.1137/1035089
Pardalos, P.M., Phillips, A.T.: Global optimization of fractional programs. J. Glob. Optim. 1(2), 173–182 (1991)
Phuong, N.T.H., Tuy, H.: A unified monotonic approach to generalized linear fractional programming. J. Glob. Optim. 26(3), 229–259 (2003). https://doi.org/10.1023/A:1023274721632
Posner, M.E., Wu, C.T.: Linear max-min programming. Math. Program. 20(1), 166–172 (1981). https://doi.org/10.1007/BF01589343
Weibel, C.: Minkowski sums of polytopes: combinatorics and computation. Ph.D. thesis, École Polytechnique Fédérale de Lausanne (2007)
Acknowledgements
This work was supported by an Early Stage Innovations grant from NASA’s Space Technology Research Grants Program, grant no. 80NSSC19K0209. This material is partially based upon work supported by the United States Air Force AFRL/SBRK under contract no. FA864921P0123.
Author information
Authors and Affiliations
Corresponding author
Additional information
Communicated by Alexander Mitsos.
Publisher's Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Rights and permissions
About this article
Cite this article
Bouvier, JB., Ornik, M. The Maximax Minimax Quotient Theorem. J Optim Theory Appl 192, 1084–1101 (2022). https://doi.org/10.1007/s10957-022-02008-z
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10957-022-02008-z