Minimax fractional programming involving generalised invex functions

DOI10.1017/S1446181100008063zbMath1042.90046OpenAlexW2087271790MaRDI QIDQ4802152

Jen-chwan Liu, Hang-Chin Lai

Publication date: 2003

Published in: The ANZIAM Journal (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1017/s1446181100008063

zbMATH Keywords

duality theoremsWolfe type dualMond-Weir type dualone parameter dual type

Mathematics Subject Classification ID

Minimax problems in mathematical programming (90C47) Fractional programming (90C32)

Related Items (7)

New optimality conditions for a nondifferentiable fractional semipreinvex programming problem ⋮ On minimax fractional programming of generalized convex set functions ⋮ Saddle point criteria in semi-infinite minimax fractional programming under (Φ,ρ)-invexity ⋮ Sufficient conditions and duality theorems for nondifferentiable minimax fractional programming ⋮ Parameter-free dual models for fractional programming with generalized invexity ⋮ Minimax fractional programming for \(n\)-set functions and mixed-type duality under generalized Invexity ⋮ A sixth bibliography of fractional programming

Cites Work

• Unnamed Item
• A class of nondifferentiable continuous programming problems
• Duality for variational problems with invexity
• Duality for a minimax programming problem containing \(n\)-set functions
• Necessary and sufficient conditions for minimax fractional programming
• Duality without a constraint qualification for minimax fractional programming
• Optimality conditions for multiobjective programming with generalized \(({\mathfrak J},\rho,\theta)\)-convex set functions
• On minimax fractional programming of generalized convex set functions
• Optimality conditions and duality for a class of continuous-time generalized fractional programming problems
• Duality in generalized linear fractional programming
• On sensitivity analysis for multicriteria optimization
• Optimality and duality for generalized fractional variational problems involving generalized (fρ)-convex functions
• Optimality conditions and duality models for generalized fractional programming problems containing locally subdifferentiable and ρ:-convex functions
• Duality for minmax programming involvingV-invex functions
• Optimality and duality for multiobjective fractional programming involving nonsmooth($si:F$esi:ρ)–convex functions

This page was built for publication: Minimax fractional programming involving generalised invex functions