Global Nonparametric Sufficient Optimality Conditions for Semi-Infinite Discrete Minmax Fractional Programming Problems Involving Generalized (η, ρ)-Invex Functions

DOI10.1080/01630560600884950zbMath1141.90548OpenAlexW4243465838MaRDI QIDQ3432719

Qinghong Zhang, G. J. Zalmai

Publication date: 18 April 2007

Published in: Numerical Functional Analysis and Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/01630560600884950

zbMATH Keywords

semi-infinite programmingsufficient optimality conditionsinfinitely many equality and inequality constraintsgeneralized invex functionsdiscrete minmax fractional programming

Mathematics Subject Classification ID

Minimax problems in mathematical programming (90C47) Nonlinear programming (90C30) Fractional programming (90C32) Semi-infinite programming (90C34)

Related Items (12)

Higher Order Hybrid Invexity Frameworks and Discrete Multiobjective Fractional Programming Problems ⋮ Hybrid (Φ,Ψ, ρ, ζ, θ)−invexity frameworks and efficiency conditions for multiobjective fractional programming problems ⋮ On Sufficient Optimality Conditions for Semi-Infinite Discrete Minmax Fractional Programming Problems Under Generalized V-Invexity ⋮ Second order \((\Phi, \rho)\)-\(V\)-invexity and duality for semi-infinite minimax fractional programming ⋮ Optimality conditions and Mond-Weir duality for a class of differentiable semi-infinite multiobjective programming problems with vanishing constraints ⋮ Global parametric sufficient efficiency conditions for semiinfinite multiobjective fractional programming problems containing generalized \((\alpha,\eta,\rho)\)-V-invex functions ⋮ Second-Order Parameter-Free Duality Models in Semi-Infinite Minmax Fractional Programming ⋮ 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 ⋮ Global parametric sufficient optimality conditions for semi-infinite discrete minmax fractional programming problems involving generalized \((\eta ,\rho )\)-invex functions ⋮ Parametric Saddle Point Criteria in Semi-Infinite Minimax Fractional Programming Problems Under (p,r)-Invexity ⋮ Semiinfinite multiobjective fractional programming, Part I: Sufficient efficiency conditions

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The essence of invexity
• On sufficiency of the Kuhn-Tucker conditions
• Bi-level strategies in semi-infinite programming.
• Semi-infinite programming and applications. An International Symposium, Austin, Texas, September 8-10, 1981
• Invexity at a point: generalisations and classification
• Semi-Infinite Programming: Theory, Methods, and Applications
• Invexity and generalized convexity
• Nonsmooth invexity
• An implementation of a discretization method for semi-infinite programming
• What is invexity?
• Invex functions and constrained local minima
• Ü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]
• On Nonlinear Fractional Programming
• Necessary and Sufficient Optimality Conditions for the Fritz John Problem with Linear Equality Constraints
• Generalized semi-infinite optimization : theory and applications in optimal control and discrete optimization
• Semi-infinite programming. Recent advances

This page was built for publication: Global Nonparametric Sufficient Optimality Conditions for Semi-Infinite Discrete Minmax Fractional Programming Problems Involving Generalized (η, ρ)-Invex Functions