A Cutting Plane Algorithm for Min-Max Fractional Programming

DOI10.1080/02522667.1989.10698960zbMath0676.90084OpenAlexW2024197504MaRDI QIDQ3832347

Enrico Sideri

Publication date: 1989

Published in: Journal of Information and Optimization Sciences (Search for Journal in Brave)

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

zbMATH Keywords

cutting plane algorithmconvex non-smooth programming

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Convex programming (90C25) Fractional programming (90C32) Existence of solutions for minimax problems (49J35) Methods of successive quadratic programming type (90C55)

Cites Work

• An algorithm for generalized fractional programs
• Generalized fractional programming: Algorithms and numerical experimentation
• Generalized fractional programming duablity: a ratio game approach
• Unnamed Item
• Unnamed Item

This page was built for publication: A Cutting Plane Algorithm for Min-Max Fractional Programming