Parametric duality models for discrete minmax fractional programming problems containing generalized \((\theta,\eta,\rho)\)-V-invex functions and arbitrary norms

DOI10.1007/BF02832304zbMath1122.49028OpenAlexW1965391725MaRDI QIDQ2454968

G. J. Zalmai

Publication date: 22 October 2007

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

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

zbMATH Keywords

duality theoremsdual problemsarbitrary normsdiscrete minmax fractional programminggeneralized \((\theta,\eta,\rho)\)-V-invex functions

Mathematics Subject Classification ID

Minimax problems in mathematical programming (90C47) Nonconvex programming, global optimization (90C26) Nonlinear programming (90C30) Optimality conditions and duality in mathematical programming (90C46) Fractional programming (90C32) Duality theory (optimization) (49N15) Optimality conditions for free problems in two or more independent variables (49K10)

Cites Work

• Unnamed Item
• Unnamed Item
• Generalized \((\eta,\rho)\)-invex functions and global parametric sufficient optimality conditions for discrete minmax fractional programming problems containing arbitrary norms
• On sufficiency of the Kuhn-Tucker conditions
• Matrix Analysis
• On generalised convex mathematical programming
• Optimality conditions and duality models for a class of nonsmooth constrained fractional variational problems

This page was built for publication: Parametric duality models for discrete minmax fractional programming problems containing generalized \((\theta,\eta,\rho)\)-V-invex functions and arbitrary norms