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

DOI10.1016/S0377-2217(03)00352-7zbMath1061.90115OpenAlexW2033288946MaRDI QIDQ1827643

Tadeusz Antczak

Publication date: 6 August 2004

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0377-2217(03)00352-7

zbMATH Keywords

dualityoptimality\((p,r)\)-invex function with respect to \(\eta\)conditionsMinimax programming

Mathematics Subject Classification ID

Minimax problems in mathematical programming (90C47) Nonconvex programming, global optimization (90C26) Optimality conditions and duality in mathematical programming (90C46)

Related Items (12)

Generalized minimax programming with nondifferentiable \((G, \beta)\)-invexity ⋮ Nondifferentiable mathematical programming involving \((G,{\beta})\)-invexity ⋮ A class of \(r\)-semipreinvex functions and optimality in nonlinear programming ⋮ Minimax programming under generalized \((p, r)\)-invexity ⋮ On nonsmooth semi-infinite minimax programming problem with \((\Phi, \rho)\)-invexity ⋮ Nonsmooth minimax programming problems withV−r-invex functions ⋮ \(E\)-differentiable minimax programming under \(E\)-convexity ⋮ Saddle point criteria in semi-infinite minimax fractional programming under (Φ,ρ)-invexity ⋮ Nonsmooth minimax programming under locally Lipschitz \((\Phi , \rho )\)-invexity ⋮ Optimality and invexity in optimization problems in Banach algebras (spaces) ⋮ Parametric Saddle Point Criteria in Semi-Infinite Minimax Fractional Programming Problems Under (p,r)-Invexity ⋮ Optimality and duality for nonsmooth minimax programming problems using convexifactor

Cites Work

• An algorithm for generalized fractional programs
• Nondifferentiable mathematical programming and convex-concave functions
• On sufficiency of the Kuhn-Tucker conditions
• Necessary conditions and sufficient conditions for static minmax problems
• A duality theorem for non-linear programming
• Invex functions and constrained local minima
• \((p,r)\)-invex sets and functions
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

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