Generalized pseudo-convex minmax programming.

DOI10.1007/BF03398537zbMath1141.90527OpenAlexW2772012207MaRDI QIDQ2468567

Shashi Kant Mishra

Publication date: 25 January 2008

Published in: Opsearch (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf03398537

Mathematics Subject Classification ID

Multi-objective and goal programming (90C29) Optimality conditions for minimax problems (49K35)

Related Items (6)

Generalized \(\alpha\)-invexity and nondifferentiable minimax fractional programming ⋮ Second order duality for nondifferentiable minimax programming problems with generalized convexity ⋮ Optimality conditions for nondifferentiable minimax programs and vector optimization problems ⋮ Nondifferentiable minimax fractional programming under generalized univexity ⋮ Generalized \(\alpha \)-univexity and duality for nondifferentiable minimax fractional programming ⋮ On nondifferentiable minimax fractional programming under generalized \(\alpha\)-type I invexity

Cites Work

• A simple derivation of necessary conditions for static minmax problems
• Duality for a class of nondifferentiable mathematical programming problems
• On sufficiency of the Kuhn-Tucker conditions
• Second order duality for a minimax programming problem
• Necessary conditions and sufficient conditions for static minmax problems
• Duality for fractional minimax programming problems
• On generalised convex mathematical programming
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Generalized pseudo-convex minmax programming.