Semiinfinite multiobjective fractional programming, Part I: Sufficient efficiency conditions

DOI10.1515/jaa.2010.014zbMath1276.90064OpenAlexW1996044532MaRDI QIDQ2865566

Qinghong Zhang, G. J. Zalmai

Publication date: 2 December 2013

Published in: Journal of Applied Analysis (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1515/jaa.2010.014

zbMATH Keywords

multiobjective fractional programminginfinitely many equality and inequality constraintsparametric sufficient efficiency conditionssemiinfinite programminggeneralized invex functions

Mathematics Subject Classification ID

Multi-objective and goal programming (90C29) Nonlinear programming (90C30) Optimality conditions and duality in mathematical programming (90C46) Fractional programming (90C32) Semi-infinite programming (90C34)

Related Items (4)

Optimality conditions and Mond-Weir duality for a class of differentiable semi-infinite multiobjective programming problems with vanishing constraints ⋮ On solving a class of fractional semi-infinite polynomial programming problems ⋮ HIGHER ORDER DUALITY FOR A NEW CLASS OF NONCONVEX SEMI-INFINITE MULTIOBJECTIVE FRACTIONAL PROGRAMMING WITH SUPPORT FUNCTIONS ⋮ Semiinfinite multiobjective fractional programming, part II: Duality models

Cites Work

• The essence of invexity
• On sufficiency of the Kuhn-Tucker conditions
• Efficiency conditions and duality models for multiobjective fractional subset programming problems with generalized \(({\mathcal F},\alpha,\rho,\theta)\)-\(V\)-convex functions
• Optimality conditions and duality for a minimax fractional programming with generalized convexity
• Nondifferentiable minimax fractional programming problems with \((C, \alpha, \rho, d)\)-convexity
• Optimality conditions and duality for nondifferentiable multiobjective fractional programming with generalized convexity
• Second order \((F, \alpha , \rho , d)\)-convexity and duality in multiobjective programming
• Invexity at a point: generalisations and classification
• Invexity and generalized convexity
• Global Nonparametric Sufficient Optimality Conditions for Semi-Infinite Discrete Minmax Fractional Programming Problems Involving Generalized (η, ρ)-Invex Functions
• Nonsmooth invexity
• Invex functions and constrained local minima
• A survey of recent[1985-1995advances in generalized convexity with applications to duality theory and optimality conditions]
• ρ-Invex Functions and ( F , ρ)Convex Functions: Properties and Equivalences
• On Nonlinear Fractional Programming

This page was built for publication: Semiinfinite multiobjective fractional programming, Part I: Sufficient efficiency conditions