Parameter-free dual models for fractional programming with generalized invexity
From MaRDI portal
Publication:1772962
DOI10.1007/s10479-004-5023-0zbMath1116.90099OpenAlexW1973288619MaRDI QIDQ1772962
Publication date: 22 April 2005
Published in: Annals of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10479-004-5023-0
generalized invexityKuhn-Tucker conditionEuler-Lagrange equationstrong dualityweak duality\((\mathcal{F},\rho,\theta)\)-invexityfractional variational programmingstrict converse duality theorems
Optimality conditions and duality in mathematical programming (90C46) Fractional programming (90C32)
Related Items (13)
On duality for mathematical programs with vanishing constraints ⋮ Mixed-Type Duality on Nonsmooth Minimax Fractional Programming Involving Exponential (p, r)-Invexity ⋮ Nondifferentiable minimax programming problems with applications ⋮ New dualities for mathematical programs with vanishing constraints ⋮ Mathematical programs with vanishing constraints involving strongly invex functions ⋮ Optimality conditions and duality for nonsmooth fractional continuous-time problems ⋮ Unnamed Item ⋮ Optimality conditions and duality in nonsmooth multiobjective optimization problems ⋮ A class of nonsmooth fractional multiobjective optimization problems ⋮ On second order duality of minimax fractional programming with square root term involving generalized \(B\)-\((p,r)\)-invex functions ⋮ Minimax fractional programming for \(n\)-set functions and mixed-type duality under generalized Invexity ⋮ A sixth bibliography of fractional programming ⋮ Complex fractional programming and the Charnes-Cooper transformation
Cites Work
- Unnamed Item
- On duality theorems for a nondifferentiable minimax fractional programming
- Nondifferentiable fractional programming in complex spaces involving \(({\mathfrak L},\varrho,\theta)\)-convex analytic functions
- A class of nondifferentiable control problems
- Duality for variational problems with invexity
- Duality for a minimax programming problem containing \(n\)-set functions
- Duality without a constraint qualification for minimax fractional programming
- Optimality conditions for multiobjective programming with generalized \(({\mathfrak J},\rho,\theta)\)-convex set functions
- Proper efficiency conditions and duality models for constrained multiobjective variational problems containing arbitrary norms
- On minimax fractional programming of generalized convex set functions
- Invex functions and constrained local minima
- Further Generalizations of Convexity in Mathematical Programming
- Sufficient optimality criteria and duality for nondifferentiable fractional variational problems with generalized (F, ρ)-convexity
- Complex Fractional Programming Involving Generalized Quasi/Pseudo Convex Functions
- Generalized (F, ρ)-convexity and duality for non smooth multi-objective programs
- Optimality conditions and duality models for a class of nonsmooth constrained fractional variational problems
- Minimax fractional programming involving generalised invex functions
This page was built for publication: Parameter-free dual models for fractional programming with generalized invexity
