A solvability theorem and minimax fractional programming

DOI10.1007/BF01415524zbMath0788.90069OpenAlexW1974384222MaRDI QIDQ4031966

Vaithilingam Jeyakumar, Joachim Gwinner

Publication date: 3 May 1993

Published in: [https://portal.mardi4nfdi.de/entity/Q3031760 ZOR Zeitschrift f�r Operations Research Methods and Models of Operations Research] (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01415524

zbMATH Keywords

stabilitysolvabilityminimax fractional programs

Mathematics Subject Classification ID

Fractional programming (90C32)

Related Items (2)

A fifth bibliography of fractional programming^* ⋮ Minimization of isotonic functions composed of Fractions

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Inequality systems and optimization
• Conjugate duality in generalized fractional programming
• Duality in generalized fractional programming via Farkas' lemma
• Equilibrium points of rational \(n\)-person games
• Zero duality gaps in infinite-dimensional programming
• Generalized fractional programming: Optimality and duality theory
• Duality in generalized linear fractional programming
• Generalized fractional programming duablity: a ratio game approach
• Approximation von Funktionen und ihre numerische Behandlung
• Linear Programming Solutions to Ratio Games
• Best Rational Approximation and Strict Quasi-Convexity
• Fractional programming

This page was built for publication: A solvability theorem and minimax fractional programming