Sufficient conditions and duality theorems for nondifferentiable minimax fractional programming

DOI10.5402/2011/786978zbMath1222.90064OpenAlexW1972095052WikidataQ58689707 ScholiaQ58689707MaRDI QIDQ541798

Shun-Chin Ho

Publication date: 8 June 2011

Published in: ISRN Mathematical Analysis (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.5402/2011/786978

zbMATH Keywords

invex functionsduality problems

Mathematics Subject Classification ID

Minimax problems in mathematical programming (90C47) Optimality conditions and duality in mathematical programming (90C46) Fractional programming (90C32)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• On duality theorems for a nondifferentiable minimax fractional programming
• Parametric duality on minimax programming involving generalized convexity in complex space
• Generalized fractional minimax programming with \(B-(p,r)\)-invexity
• On sufficiency of the Kuhn-Tucker conditions
• Corrigendum to ``Necessary conditions and sufficient conditions for static minmax problems
• On minimax fractional optimality conditions with invexity
• Necessary and sufficient conditions for minimax fractional programming
• Nondifferentiable minimax fractional programming under generalized univexity
• A class of \(B\)-(\(p\),\(r\))-invex functions and mathematical programming.
• Generalized \(\alpha\)-invexity and nondifferentiable minimax fractional programming
• Generalized \(\alpha \)-univexity and duality for nondifferentiable minimax fractional programming
• Minimax fractional programming involving generalised invex functions