On semi-infinite minmax programming with generalized invexity
From MaRDI portal
Publication:3145046
DOI10.1080/02331934.2011.563304zbMath1282.90206OpenAlexW1978444730MaRDI QIDQ3145046
Anton Stefanescu, Maria Viorica Stefanescu
Publication date: 13 December 2012
Published in: Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/02331934.2011.563304
Minimax problems in mathematical programming (90C47) Optimality conditions and duality in mathematical programming (90C46) Semi-infinite programming (90C34)
Related Items (6)
On nondifferentiable minimax semi-infinite programming problems in complex spaces ⋮ \(G\)-semipreinvexity and its applications ⋮ Optimality conditions and Mond-Weir duality for a class of differentiable semi-infinite multiobjective programming problems with vanishing constraints ⋮ Approximate solution in robust multi-objective optimization and its application in portfolio optimization ⋮ On nonsmooth semi-infinite minimax programming problem with \((\Phi, \rho)\)-invexity ⋮ Nonsmooth semi-infinite minmax programming involving generalized \((\varPhi,\rho)\)-invexity
Cites Work
- Unnamed Item
- First order optimality conditions for generalized semi-infinite programming problems
- Duality for a class of nondifferentiable mathematical programming problems
- On sufficiency of the Kuhn-Tucker conditions
- On efficiency and duality for multiobjective programs
- Necessary conditions and sufficient conditions for static minmax problems
- On minimax fractional optimality conditions with \((F,\rho)\)-convexity
- Necessary and sufficient conditions for minimax fractional programming
- Strong and Weak Convexity of Sets and Functions
- Semi-Infinite Programming: Theory, Methods, and Applications
- Generalised convexity and duality in multiple objective programming
- Invex functions and constrained local minima
- The Lagrange Multiplier Theorem for Max-Min with Several Constraints
- The Theory of Max-Min, with Applications
This page was built for publication: On semi-infinite minmax programming with generalized invexity
