On fractional programming problems with absolute-value functions
From MaRDI portal
Publication:2995467
DOI10.1080/00207161003692903zbMATH Open1216.90090OpenAlexW2019420198MaRDI QIDQ2995467FDOQ2995467
Publication date: 21 April 2011
Published in: International Journal of Computer Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/00207161003692903
Recommendations
- Fractional programming with absolute-value functions
- Nondifferentiable minimax fractional programming problem with nonsmooth generalized convex functions
- An approximate approach for fractional programming with absolute-value functions
- Minimization of the ratio of functions defined as sums of the absolute values
- On programming with absolute value functions
Cites Work
Cited In (6)
- Farkas-type results for fractional programming problems
- On a class of fractional functional programming problems
- An approximate approach for fractional programming with absolute-value functions
- Fractional programming with absolute-value functions
- A new branch and bound algorithm for minimax ratios problems
- A new linearization technique for minimax linear fractional programming
This page was built for publication: On fractional programming problems with absolute-value functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2995467)