Global parametric sufficient optimality conditions for semi-infinite discrete minmax fractional programming problems involving generalized \((\eta ,\rho )\)-invex functions
From MaRDI portal
Publication:1036869
DOI10.1007/s10255-007-0365-4zbMath1206.90211OpenAlexW2008945829MaRDI QIDQ1036869
Publication date: 13 November 2009
Published in: Acta Mathematicae Applicatae Sinica. English Series (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10255-007-0365-4
Optimality conditions and duality in mathematical programming (90C46) Semi-infinite programming (90C34)
Related Items
Unnamed Item, Global parametric sufficient efficiency conditions for semiinfinite multiobjective fractional programming problems containing generalized \((\alpha,\eta,\rho)\)-V-invex functions, Parametric duality models for semi-infinite discrete minmax fractional programming problems involving generalized \((\eta ,\rho )\)-invex functions, Saddle point criteria in semi-infinite minimax fractional programming under (Φ,ρ)-invexity, Duality for nondifferentiable minimax fractional programming problem involving higher order \((C,\alpha, \rho, d)\)-convexity, Unnamed Item, Parametric Saddle Point Criteria in Semi-Infinite Minimax Fractional Programming Problems Under (p,r)-Invexity
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Linear optimization and approximation. An introduction to the theoretical analysis and numerical treatment of semi-infinite programs. Transl. from the German
- The essence of invexity
- On sufficiency of the Kuhn-Tucker conditions
- On generalized convex functions in optimization theory -- a survey
- Constrained qualifications in multiobjective optimization problems: Differentiable case
- Semi-infinite programming. Workshop, Cottbus, Germany, September 1996
- Bi-level strategies in semi-infinite programming.
- Semi-infinite programming and applications. An International Symposium, Austin, Texas, September 8-10, 1981
- Parametric duality models for semi-infinite discrete minmax fractional programming problems involving generalized \((\eta ,\rho )\)-invex functions
- Invexity at a point: generalisations and classification
- Semi-Infinite Programming: Theory, Methods, and Applications
- Invexity and generalized convexity
- Global Nonparametric Sufficient Optimality Conditions for Semi-Infinite Discrete Minmax Fractional Programming Problems Involving Generalized (η, ρ)-Invex Functions
- Nonsmooth invexity
- An implementation of a discretization method for semi-infinite programming
- What is invexity?
- Invex functions and constrained local minima
- Further Generalizations of Convexity in Mathematical Programming
- Über einige Anwendungen der semiinfiniten Optimierung
- Optimality principles and duality models for a class of continuous-time generalized fractional programming problems with operator constraints
- A survey of recent[1985-1995advances in generalized convexity with applications to duality theory and optimality conditions]
- Various types of nonsmooth invex functions
- Generalized semi-infinite optimization : theory and applications in optimal control and discrete optimization
- Semi-infinite programming. Recent advances
