-optimality for minimax programming problems

MaRDI QIDQ3410666zbMATH OpenFDO

Authors Pankaj Gupta, Aparna Mehra, Shunsuke Shiraishi, Kazunori Yokoyama

Publication date 29 November 2006

zbMATH Keywords

\(\varepsilon\)-optimal solution\(\varepsilon\)-parametric approach\(\varepsilon\)-subdifferentialgeneralized fractional programmingminimax programmingnecessary and sufficient optimality conditions

Mathematics Subject Classification ID

Optimality conditions for minimax problems (49K35) Fractional programming (90C32) Optimality conditions and duality in mathematical programming (90C46)

Recommendations

• \(\epsilon\)-formality and duality for fractional programming
• -optimality and duality for multiobjective fractional programming
• Publication:3481503
• Necessary and sufficient conditions for minimax fractional programming
• On necessary conditions for a class of nondifferentiable minimax fractional programming

Cited in

(5)

• A parametric embedding for the finite minimax problem
• \(\epsilon\)-formality and duality for fractional programming
• On -solutions for robust fractional optimization problems
• Epsilon-solutions and epsilon-supports
• Optimality and duality in nondifferentiable minimax programming problems involving \(\epsilon\)-quasi solutions

This page was built for publication: \(\varepsilon\)-optimality for minimax programming problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3410666)