Optimality and duality for generalized fractional programming involving nonsmooth pseudoindex functions
From MaRDI portal
Publication:1922952
DOI10.1006/jmaa.1996.0341zbMath0856.90107OpenAlexW2076153672MaRDI QIDQ1922952
Publication date: 30 September 1996
Published in: Journal of Mathematical Analysis and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1006/jmaa.1996.0341
duality theoremsparametric approachpseudoinvex functionsnonsmooth generalized minimax fractional programming
Nonsmooth analysis (49J52) Fractional programming (90C32) Convexity of real functions of several variables, generalizations (26B25)
Related Items
Sufficient optimality criteria and duality for nondifferentiable fractional variational problems with generalized (F, ρ)-convexity ⋮ Nondifferentiable minimax fractional programming problems with \((C, \alpha, \rho, d)\)-convexity ⋮ A fifth bibliography of fractional programming* ⋮ Duality in Vector Optimization Under Type 1 α-Invexity in Banach Spaces ⋮ Optimality and Duality for Invex Nonsmooth Multiobjective programming problems ⋮ Optimality conditions for multiobjective programming with generalized \(({\mathfrak J},\rho,\theta)\)-convex set functions ⋮ Duality for multiobjective fractional programming problem using convexifactors ⋮ Mixed Lagrange function in minimax fractional programming problems ⋮ Duality for fractional interval-valued optimization problem via convexificator ⋮ Three types dual model for minimax fractional programming ⋮ Optimality criteria and duality in multiobjective programming involving nonsmooth invex functions ⋮ Optimality conditions and duality in nonsmooth multiobjective programs ⋮ Generalized fractional minimax programming with \(B-(p,r)\)-invexity ⋮ On minimax fractional optimality conditions with invexity ⋮ On minimax fractional optimality conditions with \((F,\rho)\)-convexity ⋮ 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 and duality for a minimax fractional programming with generalized convexity
