Farkas-type results for fractional programming problems

DOI10.1016/j.na.2006.07.041zbMath1278.90395OpenAlexW2050337140MaRDI QIDQ2371162

Radu Ioan Boţ, Ioan Bogdan Hodrea, Gert Wanka

Publication date: 29 June 2007

Published in: Nonlinear Analysis. Theory, Methods \& Applications. Series A: Theory and Methods (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.na.2006.07.041

zbMATH Keywords

fractional programmingconjugate functionsconjugate dualityFarkas-type resultsDCfunctions

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26) Fractional programming (90C32) Duality theory (optimization) (49N15)

Related Items (13)

Some characterizations of robust optimal solutions for uncertain fractional optimization and applications ⋮ Fenchel-Lagrange duality for DC infinite programs with inequality constraints ⋮ Some dual characterizations of Farkas-type results for fractional programming problems ⋮ Duality and Farkas-type results for extended Ky Fan inequalities with DC functions ⋮ Farkas-type results for constrained fractional programming with DC functions ⋮ Structural dynamic model updating techniques: a state of the art review ⋮ Sequential optimality conditions for fractional optimization with applications to vector optimization ⋮ Duality and Farkas-type results for DC fractional programming with DC constraints ⋮ Nondifferentiable fractional semi-infinite multiobjective optimization problems ⋮ The stable Farkas lemma for composite convex functions in infinite dimensional spaces ⋮ On robust duality for fractional programming with uncertainty data ⋮ Some Farkas-type results for fractional programming problems with DC functions ⋮ Regularity conditions characterizing Fenchel-Lagrange duality and Farkas-type results in DC infinite programming

Cites Work

• Unnamed Item
• Duality for multiobjective optimization problems with convex objective functions and D.C. constraints
• Modified Dinkelbach-Type algorithm for generalized fractional programs with infinitely many ratios
• Strong duality for generalized convex optimization problems
• Duality in D. C. programming: The case of several D. C. constraints
• On minimax fractional optimality and duality with generalized convexity
• New constraint qualification and conjugate duality for composed convex optimization problems
• Farkas-type results for inequality systems with composed convex functions via conjugate duality
• The dual of a fractional linear program
• Duality in Fractional Programming: A Unified Approach
• Characterizing Set Containments Involving Infinite Convex Constraints and Reverse-Convex Constraints
• Farkas-Type Results With Conjugate Functions
• On Nonlinear Fractional Programming
• Programming Problems with Convex Fractional Functions
• Duality in nonlinear fractional programming

This page was built for publication: Farkas-type results for fractional programming problems