Mixed Duality without Constraint Qualification for Nonsmooth Fractional Programming
From MaRDI portal
Publication:5438286
DOI10.1080/01630560701766692zbMath1149.90158OpenAlexW1995839898MaRDI QIDQ5438286
Publication date: 23 January 2008
Published in: Numerical Functional Analysis and Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/01630560701766692
nonsmooth analysisoptimality conditionsconstraint qualificationnonsmooth multiobjective fractional programmingmixed duality
Cites Work
- Unnamed Item
- Duality without a constraint qualification for minimax fractional programming
- Optimality conditions and duality in subdifferentiable multiobjective fractional programming
- Optimality and duality in fractional multiple objective programming involving semilocally preinvex and related functions.
- Optimality and duality for the multiobjective fractional programming with the generalized \((F,\rho)\) convexity.
- Nondifferentiable multiobjective programming under generalized \(d\)-univexity
- Duality without constraint qualification in nonsmooth optimization
- Optimization and nonsmooth analysis
- Generalised convexity and duality in multiple objective programming
- Optimality Conditions in Directionally Differentiable Pareto Problems with a Set Constraint via Tangent Cones
- Mixed duality without a constraint qualification for minimax fractional programming
- A Multiplier Rule for Multiobjective Programming Problems with Continuous Data
- Optimality and Duality for Invex Nonsmooth Multiobjective programming problems
- Optimality and duality for multiobjective fractional programming involving nonsmooth($si:F$esi:ρ)–convex functions
- Optimality and duality for multiobjective fractional programming involving nonsmooth pseudoinvex functions
- Optimality and duality for nonsmooth multiobjective fractional programming with generalized invexity
This page was built for publication: Mixed Duality without Constraint Qualification for Nonsmooth Fractional Programming
