Minimax programming under generalized \((p, r)\)-invexity

DOI10.1007/S11424-007-9047-9zbMATH Open1138.49023OpenAlexW1998733950MaRDI QIDQ2425833

Yanyan Li

Publication date: 7 May 2008

Published in: Journal of Systems Science and Complexity (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11424-007-9047-9

zbMATH Keywords

optimality conditionsdualityminimax programming\((p,r)\)-invex functions

Mathematics Subject Classification ID

Duality theory (optimization) (49N15) Optimality conditions for minimax problems (49K35)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• An algorithm for generalized fractional programs
• Nondifferentiable mathematical programming and convex-concave functions
• Minimax programming under \((p,r)\)-invexity
• Pseudolinear fractional minmax programming
• Generalized (p, r)-Invexity in Mathematical Programming
• Nonlinear Programming
• \((p,r)\)-invex sets and functions

Related Items (4)

\(E\)-differentiable minimax programming under \(E\)-convexity ⋮ Minmax programming problems with \(L_ p\)-norms via nonsmooth \(V\)-invexity. ⋮ Nonsmooth minimax programming under locally Lipschitz \((\Phi , \rho )\)-invexity ⋮ Parametric Saddle Point Criteria in Semi-Infinite Minimax Fractional Programming Problems Under (p,r)-Invexity

This page was built for publication: Minimax programming under generalized \((p, r)\)-invexity