Second-order duality for nondifferentiable minimax fractional programming problems with generalized convexity

DOI10.1186/1029-242X-2013-500zbMath1291.90258WikidataQ59295073 ScholiaQ59295073MaRDI QIDQ2250374

Meraj Ali Khan

Publication date: 7 July 2014

Published in: Journal of Inequalities and Applications (Search for Journal in Brave)

zbMATH Keywords

generalized convexitydualityfractional programmingminimax programming

Mathematics Subject Classification ID

Fractional programming (90C32) Duality theory (optimization) (49N15) Optimality conditions for minimax problems (49K35)

Related Items (2)

On second order duality of minimax fractional programming with square root term involving generalized \(B\)-\((p,r)\)-invex functions ⋮ A generalized gradient projection method based on a new working set for minimax optimization problems with inequality constraints

Cites Work

• On second-order duality for minimax fractional programming problems with generalized convexity
• (Generalized) bonvexity and higher order duality for fractional programming
• Second- and higher-order duality in nonlinear programming
• On minimax fractional optimality conditions with invexity
• On minimax fractional optimality conditions with \((F,\rho)\)-convexity
• Necessary and sufficient conditions for minimax fractional programming
• Duality for fractional minimax programming problems
• Lower subdifferentiability in minimax fractional programming^*
• Linear Programming Solutions to Ratio Games
• Best Rational Approximation and Strict Quasi-Convexity
• Unnamed Item

This page was built for publication: Second-order duality for nondifferentiable minimax fractional programming problems with generalized convexity