On sufficiency and duality for generalized quasiconvex programs
From MaRDI portal
Publication:1323225
DOI10.1006/jmaa.1994.1006zbMath0807.90106OpenAlexW2012889588MaRDI QIDQ1323225
Publication date: 1 March 1995
Published in: Journal of Mathematical Analysis and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1006/jmaa.1994.1006
quasiconvexitynonlinear optimizationduality theoremssufficient optimality conditionsinequality and equality constraintsgeneralized quasiconvex program
Nonconvex programming, global optimization (90C26) Nonlinear programming (90C30) Duality theory (optimization) (49N15) Convexity of real functions of several variables, generalizations (26B25)
Related Items (11)
Sufficient optimality criteria and duality for nondifferentiable fractional variational problems with generalized (F, ρ)-convexity ⋮ Conditions for solutions, their globality, and their duality relations in vector optimization with relaxed quasiconvexity ⋮ Optimality conditions for multiobjective programming with generalized \(({\mathfrak J},\rho,\theta)\)-convex set functions ⋮ Duality for nondifferentiable static multiobjective variational problems involving generalized \((F,\rho)\)-convex functions ⋮ Optimality and duality for generalized fractional variational problems involving generalized (fρ)-convex functions ⋮ Optimality and duality for multiobjective fractional programming involving nonsmooth generalized \((\mathcal F, b, \phi, \rho, \theta)\)-univex functions ⋮ Three types dual model for minimax fractional programming ⋮ Optimality and duality for multiobjective fractional programming involving nonsmooth($si:F$esi:ρ)–convex functions ⋮ On sufficiency and duality for generalised quasicnvex nonsmooth programs ⋮ Optimality and duality for generalized fractional programming involving nonsmooth \((F,\rho)\)-convex functions ⋮ Second order symmetric duality in mathematical programming with \(F\)-convexity
This page was built for publication: On sufficiency and duality for generalized quasiconvex programs