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"ive 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.
Recommendations
Cites work
- A continuous version of a result of Du and Hwang
- A unified monotonic approach to generalized linear fractional programming
- Global optimization of fractional programs
- Infinite dimensional analysis. A hitchhiker's guide.
- Linear max-min programming
- Programming with linear fractional functionals
- Semi-Infinite Programming: Theory, Methods, and Applications
This page was built for publication: The maximax minimax quotient theorem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2116624)
