Optimality and duality for minmax problems involving arcwise connected and generalized arcwise connected functions

DOI10.1006/jmaa.1998.6231zbMath0916.90245OpenAlexW1999820972MaRDI QIDQ1283108

Davinder Bhatia, Aparna Mehra

Publication date: 13 April 1999

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

Full work available at URL: https://doi.org/10.1006/jmaa.1998.6231

zbMATH Keywords

necessary optimality conditionssufficient optimality conditionsMond-Weir type dualstatic minmax programming

Mathematics Subject Classification ID

Nonlinear programming (90C30) Optimality conditions for minimax problems (49K35)

Related Items (4)

Set-valued minimax programming problems under generalized cone convexity ⋮ \(E\)-differentiable minimax programming under \(E\)-convexity ⋮ Nonsmooth minimax programming under locally Lipschitz \((\Phi , \rho )\)-invexity ⋮ Optimality conditions and duality for semi-infinite programming involving B-arcwise connected functions

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Inequality systems and optimization
• Elementary properties of arcwise connected sets and functions
• Duality for a class of nondifferentiable mathematical programming problems in complex space
• Generalized arcwise-connected functions and characterizations of local- global minimum properties
• Duality for a class of nondifferentiable mathematical programming problems
• Necessary conditions and sufficient conditions for static minmax problems
• The Lagrange Multiplier Theorem for Max-Min with Several Constraints
• The Theory of Max-Min, with Applications

This page was built for publication: Optimality and duality for minmax problems involving arcwise connected and generalized arcwise connected functions