Generalized minimax programming with nondifferentiable (G, )-invexity
From MaRDI portal
Publication:2375696
Summary: We consider the generalized minimax programming problem (P) in which functions are locally Lipschitz \((G, \beta)\)-invex. Not only \(G\)-sufficient but also \(G\)-necessary optimality conditions are established for problem (P). With \(G\)-necessary optimality conditions and \((G, \beta)\)-invexity on hand, we construct dual problem (DI) for the primal one (P) and prove duality results between problems (P) and (DI). These results extend several known results to a wider class of programs.
Recommendations
- Minimax fractional programming with nondifferentiable (G,)-invexity
- Minimax programming with (G,)-invexity
- Optimality conditions and duality for nonsmooth minimax programming problems under generalized invexity
- Generalized \(\alpha\)-invexity and nondifferentiable minimax fractional programming
- Nondifferentiable mathematical programming involving \((G,{\beta})\)-invexity
Cites work
- \((p,r)\)-invex sets and functions
- A characterization of strict local minimizers of order one for nonsmooth static minmax problems
- Duality in nondifferentiable minimax fractional programming with \(B-(p, r)\)-invexity
- Generalized fractional minimax programming with \(B-(p,r)\)-invexity
- scientific article; zbMATH DE number 5240503 (Why is no real title available?)
- Minimax programming under (p,r)-invexity
- New optimality conditions and duality results of \(G\) type in differentiable mathematical programming
- Nondifferentiable mathematical programming involving \((G,{\beta})\)-invexity
- Nondifferentiable minimax fractional programming problems with \((C, \alpha, \rho, d)\)-convexity
- Nonsmooth minimax programming problems with \(V\)-\(r\)-invex functions
- Nonsmooth minimax programming under locally Lipschitz \((\Phi , \rho )\)-invexity
- On G-invex multiobjective programming. I: Optimality
- On G-invex multiobjective programming. II: Duality
- On duality theorems for a nondifferentiable minimax fractional programming
- On efficiency and duality for multiobjective programs
- On sufficiency of the Kuhn-Tucker conditions
- Optimality conditions and duality for a class of nonlinear fractional programming problems.
- Optimization and nonsmooth analysis
- The Notion of V-r-Invexity in Differentiable Multiobjective Programming
- What is invexity?
Cited in
(6)- Higher-order duality for multiobjective programming problem involving \((\Phi, \rho)\)-invex functions
- Minimax fractional programming with nondifferentiable (G,)-invexity
- scientific article; zbMATH DE number 4055404 (Why is no real title available?)
- Nondifferentiable mathematical programming involving \((G,{\beta})\)-invexity
- Minimax programming with (G,)-invexity
- (G, V)-invexity nondifferentiable generalized minimax fractional programming
This page was built for publication: Generalized minimax programming with nondifferentiable \((G, \beta)\)-invexity
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2375696)
