Optimization problems with algebraic solutions: Quadratic fractional programs and ratio games

From MaRDI portal





A mathematical program with a rational objective function may have irrational algebraic solutions even when the data are integral. We suggest that for such problems the optimal solution will be represented as follows: If \(\lambda^*\) denotes the optimal value there will be given an interval I and a polynomial P(\(\lambda)\) such that I contains \(\lambda^*\) and \(\lambda^*\) is the unique root of P(\(\lambda)\) in I. It is shown that with this representation the solutions to convex quadratic fractional programs and ratio games can be obtained in polynomial time.



Cites work









This page was built for publication: Optimization problems with algebraic solutions: Quadratic fractional programs and ratio games

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3688122)