A sequential method for a class of pseudoconcave fractional problems

DOI10.1007/s10100-007-0050-yzbMath1152.90618OpenAlexW1990709590MaRDI QIDQ940830

Laura Carosi, Laura Martein

Publication date: 3 September 2008

Published in: CEJOR. Central European Journal of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10100-007-0050-y

zbMATH Keywords

fractional programmingpost-optimality analysispseudoconcavity

Mathematics Subject Classification ID

Fractional programming (90C32) Convexity of real functions of several variables, generalizations (26B25)

Related Items (4)

A survey of hidden convex optimization ⋮ Pseudoconvexity on a closed convex set: an application to a wide class of generalized fractional functions ⋮ Simplex-like sequential methods for a class of generalized fractional programs ⋮ Minimizing the sum of a linear and a linear fractional function applying conic quadratic representation: continuous and discrete problems

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Generating sum-of-ratios test problems in global optimization
• Parametric simplex algorithms for solving a special class of nonconvex minimization problems
• Generalized concavity
• Generalized linear multiplicative and fractional programming
• Solving sum-of-ratios fractional programs using efficient points
• Massimo della somma tra una funzione lineare ed una funzione lineare fratta
• On Maximizing a Sum of Ratios
• On the Pseudoconvexity of a Quadratic Fractional Function
• Programming with linear fractional functionals
• Fractional Programming

This page was built for publication: A sequential method for a class of pseudoconcave fractional problems