Publication:5465347

zbMath1149.90412MaRDI QIDQ5465347

Jianming Shi, Siegfried Schaible

Publication date: 22 August 2005

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Mathematics Subject Classification ID

Minimax problems in mathematical programming (90C47) Fractional programming (90C32)

Related Items

Finding the efficiency status and efficient projection in multiobjective linear fractional programming: a linear programming technique, Subset selection for multiple linear regression via optimization, Block sparse signal recovery via minimizing the block \(q\)-ratio sparsity, Necessary and sufficient conditions for achieving global optimal solutions in multiobjective quadratic fractional optimization problems, Using the Dinkelbach-type algorithm to solve the continuous-time linear fractional programming problems, Using the parametric approach to solve the continuous-time linear fractional Max-min problems, An iterative approach to solve multiobjective linear fractional programming problems, An extension of branch-and-bound algorithm for solving sum-of-nonlinear-ratios problem, Bounded lower subdifferentiability optimization techniques: applications, On a recurrence algorithm for continuous-time linear fractional programming problems, Parameter-free duality models and applications to semi-infinite minmax fractional programming based on second-order (\(\phi,\eta ,\rho ,\theta,\tilde{m}\))-sonvexities, A sixth bibliography of fractional programming, Pareto optimality conditions and duality for vector quadratic fractional optimization problems, A Polynomial Algorithm for a Class of 0–1 Fractional Programming Problems Involving Composite Functions, with an Application to Additive Clustering