Optimizing of sums and products of linear fractional functions under linear constraints

DOI10.1080/02331939608844235zbMath0863.65033OpenAlexW1985694389MaRDI QIDQ2785387

No author found.

Publication date: 9 April 1997

Published in: Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/02331939608844235

zbMATH Keywords

algorithmsnumerical examplesnonconvex optimizationfractional programmingsimplex methodCharnes-Cooper transformationcomposite objective functions

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Multi-objective and goal programming (90C29) Fractional programming (90C32)

Related Items (1)

On second order cone programming approach to two-stage network data envelopment analysis

Cites Work

• Parametric simplex algorithms for solving a special class of nonconvex minimization problems
• A parametric method for solving certain nonconcave maximization problems
• A convergent criss-cross method
• Zur Extremwertannahme und Dualität bei Optimierungsproblemen mit linearem und gebrochen linearem Zielfunktionsanteil
• Die Maximierung eines Quotienten zweier linearer Funktionen unter linearen Nebenbedingungen

This page was built for publication: Optimizing of sums and products of linear fractional functions under linear constraints