Global parametric sufficient optimality conditions for discrete minmax fractional programming problems containing generalized \((\theta,\eta,\rho)\)-V-invex functions and arbitrary norms

DOI10.1007/BF02831955zbMath1151.90037OpenAlexW2035595011MaRDI QIDQ874317

G. J. Zalmai

Publication date: 5 April 2007

Published in: Journal of Applied Mathematics and Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02831955

zbMATH Keywords

sufficient optimality conditionsDiscrete minmax fractional programminggeneralized \((\theta, \eta, \rho)\)-V-invexity

Mathematics Subject Classification ID

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

Related Items (2)

Higher Order Hybrid Invexity Frameworks and Discrete Multiobjective Fractional Programming Problems ⋮ Hybrid (Φ,Ψ, ρ, ζ, θ)−invexity frameworks and efficiency conditions for multiobjective fractional programming problems

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The essence of invexity
• Generalized \( (\eta,\rho)\)-invex functions and parametric duality models for discrete minmax fractional programming problems containing arbitrary norms
• On sufficiency of the Kuhn-Tucker conditions
• Goal programming and multiple objective optimizations. Part I
• A class of programming problems whose objective function contains a norm
• On generalized convex functions in optimization theory -- a survey
• Constraint qualifications and Lagrange multipliers in nondifferentiable programming problems
• Discrete and fractional programming techniques for location models
• Invexity at a point: generalisations and classification
• Invexity and generalized convexity
• Nonsmooth invexity
• Matrix Analysis
• What is invexity?
• Invex functions and constrained local minima
• Further Generalizations of Convexity in Mathematical Programming
• On generalised convex mathematical programming
• Multicriteria Programming for Financial Planning
• 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
• Optimality conditions and duality models for a class of nonsmooth constrained fractional variational problems
• On Nonlinear Fractional Programming
• The Differential Correction Algorithm for Rational $\ell _\infty $-Approximation
• Best Rational Approximation and Strict Quasi-Convexity
• On An Invariant of Plane Regions and Mass Distributions

This page was built for publication: Global parametric sufficient optimality conditions for discrete minmax fractional programming problems containing generalized \((\theta,\eta,\rho)\)-V-invex functions and arbitrary norms